摘要：
#include <stdio.h>long a[500005];long long merge_inversions(long p, long q, long r){ long n1 = q - p + 1; long n2 = r - q; long *left = new long[n1+1]; long *right = new long[n2+1]; long i, j; for(i = 0; i < n1; i++) left[i] = a[p + i]; for(j = 0; j < n2; j++) right[j] = a[q + j + 1]; le 阅读全文