题目链接:超快速排序
AC代码:
#include<iostream>
#include<cstdio>
using namespace std;
typedef long long LL;
const int N = 500010;
LL q[N], tmp[N];
LL merge_sort(LL q[], int l, int r) {
if (l >= r) return 0;
int mid = l + r >> 1;
LL res = merge_sort(q, l, mid) + merge_sort(q, mid + 1, r);//排序
int k = 0, i = l, j = mid + 1;//归并
while (i <= mid && j <= r)
if (q[i] <= q[j]) tmp[k++] = q[i++];
else {
tmp[k++] = q[j++];
res += mid - i + 1;
}
while (i <= mid) tmp[k++] = q[i++];
while (j <= r) tmp[k++] = q[j++];
for (int i = l, j = 0; i <= r; i++, j++) q[i] = tmp[j];
return res;
}
int main()
{
int n;
while (scanf("%d", &n), n) {
for (int i = 0; i < n; i++) scanf("%d", &q[i]);
printf("%lld\n", merge_sort(q, 0, n - 1));
}
system("pause");
return 0;
}