AcWing 逆序对的数量 题解（归并排序求逆序对的模板）

#include<iostream>

using namespace std;

typedef long long ll;

const int N =  1e5 + 10;

int q[N], temp[N];
int n;

ll merge_sort(int q[], int l, int r){
	if(l >= r) return 0;
	int mid = (l + r) >> 1;
	ll rv = merge_sort(q, l, mid) + merge_sort(q, mid + 1, r);
	int i = l, j = mid + 1, k = 0;
	while(i <= mid && j <= r){
		if(q[i] <= q[j]){
			temp[k ++ ] = q[i ++ ];
		}
		else{
			temp[k ++ ] = q[j ++ ];
			rv += 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 rv;
}

int main()
{
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(false);
	cin>>n;
	for(int i = 0; i < n; i ++ ){
		cin>>q[i];
	}
	ll t = merge_sort(q, 0, n- 1);
	cout<<t<<endl;
	return 0;
}