求逆序数（归并排序）

思路：通过归并时比较子数组大小来计算逆序数个数，比枚举复杂度低

#include<iostream>
using namespace std;
const int N = 10e5 + 10;
int q[N],temp[N];

long long merge_sort(int q[],int l, int r)
{
	if (l == r)
		return 0;
	int mid = l + r >> 1;
	long long result = 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++];
			result += mid - i + 1;//计数
		}
	}
	while (i <= mid)
		temp[k++] = q[i++];
	while (j <= r)
		temp[k++] = q[j++];
	for (int i = 0, j = l; j <= r; i++, j++)
	{
		q[j] = temp[i];
	}
	return result;
}
int main()
{
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> q[i];
	cout << merge_sort(q,0,n-1) << endl;
}