归并排序求逆序对

PS：学别人的

#include<iostream>
#include<cstdio>
#include<string.h>
#include<cstring>
#include<string>
#include<stack>
#include<set>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>

#define LOCAL
#define ll long long
#define lll unsigned long long
#define MAX 1000009
#define eps 1e-8
#define INF 0x7fffffff
#define mod 1000000007

using namespace std;
/*

题意：

想法：归并排序求逆序对

*/
ll ans;
int a[MAX];
int b[MAX];

void mergesort(int * a,int left,int right)
{
    if(left==right) return ;
    else
    {
        int mid = left + (right - left)/2;
        mergesort(a,left,mid);
        mergesort(a,mid+1,right);
        int i,j,k;
        i = left,j = mid + 1,k = left;
        while(i<=mid&&j<=right)
        {
            if(a[i]<=a[j])
                b[k++] = a[i++];
            else
            {
                b[k++] = a[j++];
                ans+=mid - i + 1;
            }
        }
        while(i<=mid) b[k++] = a[i++];
        while(j<=right) b[k++] = a[j++];
        for(int i = left;i<=right;i++) a[i] = b[i];
    }
}

int main()
{
   // freopen("date.in","r",stdin);
    int n;
    scanf("%d",&n);
    for(int i = 0; i<n; i++)scanf("%d",&a[i]);
    mergesort(a,0,n-1);
    printf("%lld\n",ans);
    return 0;
}