[归并排序] 求逆序对 luogu1908 比树状数组快

题目

题目链接：https://www.luogu.com.cn/problem/P1908

思路

归并就是二分然后…
哎呀我好懒的打

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
int a[500010],c[500010];
int ans=0;
void msort(int s,int e){
	if(s==e) return;
	int mid=(s+e)>>1;
	int k=s;
	int i=s,n=e,m=mid,j=mid+1;
	msort(s,mid);
	msort(mid+1,e);
	while(i<=m&&j<=n){
		if(a[i]<=a[j]){
			c[k++]=a[i++];
		}
		else{
			c[k++]=a[j++],ans+=mid-i+1;
		}
		
	}while(i<=mid){
			c[k++]=a[i++];
		}
		while(j<=e){
			c[k++]=a[j++];
		}
		for(int k=s;k<=e;k++) a[k]=c[k];
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	msort(1,n);
	cout<<ans<<endl;
    return 0;
}