归并排序的应用——求逆序数

更新：我要放一个更清楚的博客
https://blog.csdn.net/baiyifeifei/article/details/81665051

#include<iostream>
using namespace std;
long long sum;
long long a[1000010];
long long b[1000010];
void mergearray(int left,int mid,int right){
	int i=left,x=mid;
	int j=mid+1,y=right;
	int k=left;
	while(i<=x&&j<=y){
		if(a[i]>a[j]){
			b[k++]=a[j++];
			sum+=mid-i+1;
		}
		else{b[k++]=a[i++];
		}
	}
	while(i<=x)b[k++]=a[i++];
	while(j<=y)b[k++]=a[j++];
	for(int i=left;i<=right;i++)
		a[i]=b[i];
}
void mergesort(int left,int right){
	if(left<right){
		int mid=(left+right)/2;
		mergesort(left,mid);
		mergesort(mid+1,right);
		mergearray(left,mid,right);
	}
}
int main(){
	int n;
	cin>>n;
	sum=0;
	for(int i=0;i<n;i++)
		cin>>a[i];
	mergesort(0,n-1);
	cout<<sum<<endl;
	return 0;
}