逆序对的数量

#include<iostream>
using namespace std;
int const N=100000;
int n;
int a[N],t[N];

long long merge_sort(int l,int r)
{
	if(l>=r) return 0;
	int mid=(l+r)/2;
	long long res=merge_sort(l,mid)+merge_sort(mid+1,r);
	int k=0,i=l,j=mid+1;
	while(i<=mid&&j<=r)
	{
		if(a[i]<=a[j]) t[k++]=a[i++];
		else
		{
			t[k++]=a[j++];
			res+=mid-i+1;
		}
	}
	while(i<=mid) t[k++]=a[i++];
	while(j<=r) t[k++]=a[j++];
	for(int i=l,j=0;i<=r;i++,j++) a[i]=t[j];
	return res;
}

int main()
{
	cin>>n;
	for(int i=0;i<n;i++) cin>>a[i];
	cout<<merge_sort(0,n-1);
	return 0;
}