acwing 逆序对的数量

                                                                  归并排序的应用

#include<iostream>
using namespace std;

const int N=100005;

typedef long long LL;
int q[N],tmp[N];
	int n;


LL merge_sort(int l,int r)
{
	if(l>=r)return 0;
	
	int mid=(l+r)/2;
	
	LL res=merge_sort(l,mid)+merge_sort(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()
{

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