归并排序
- 逆序对的数量
视频题解:https://www.acwing.com/video/230/
注意:这里假设merge_sort是可以在排序的同时并且输出整个区间内部的逆序对的数量
#include<iostream>
using namespace std;
typedef long long LL;
const int N=100010;
int q[N],temp[N];
LL merge_sort(int l,int r){
if(l>=r) return 0;//返回0
int mid=l+r>>1;
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]) temp[k++]=q[i++];
else {//只有q[i]>q[j]时,q[i]以及其后面的数才能与q[j]构成逆序对,这时就记录一下,
temp[k++]=q[j++];
res+=mid-i+1;
}
}
while(i<=mid) temp[k++]=q[i++];
while(j<=r) temp[k++]=q[j++];
for (i = l, j = 0; i <= r; i ++, j ++ ) q[i] = temp[j];
return res;
}
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%d",&q[i]);
cout<<merge_sort(0,n-1)<<endl;
return 0;
}