sdut oj 3402 数据结构实验之排序五：归并求逆序数

#include <cstdio>
#include <cstdlib>
#include <iostream>
using namespace std;
const int maxsize=100000+10;
int a[maxsize];
int t[maxsize]={0};
long long cnt=0;
void merge_sort(int* a,int x,int y,int* t)
{
    if(y-x > 1)
    {
        int m = x + (y-x)/2;
        int p = x,q = m,i = x;
        merge_sort(a,x,m,t);
        merge_sort(a,m,y,t);
        while(p < m || q < y)
        {
            if(q >= y || (p < m && a[p] <= a[q]))
                t[i++] = a[p++];
            else
            {
                t[i++] = a[q++];
                cnt += m-p;
            }
        }
        for(i = x; i < y; i++) a[i] = t[i];
    }
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1; i<=n; i++)
        scanf("%d",&a[i]);
    merge_sort(a,1,n+1,t);//注意是n+1
    cout << cnt << endl;
    return 0;
}