acwing 788 逆序对的数量

如果暴力求解，会超时，时间复杂度是o(n^2)
简便算法：利用归并排序的归并阶段，可以求出逆序对的数量
假设数组左右两边分别为low，high，中间值为mid = low + high >> 1
i = low , j = mid + 1,当找到a[i] >= a[j]的时候，说明a[i]到a[mid]都是比a[j]要大的元素，所以个数就是mid - i + 1。
代码如下

#include<iostream>
using namespace std;
const int N = 1e5 + 10;
int a[N];
long long res;
void merge_sort(int a[], int low, int high){
    if(low < high){
    int mid = low + high >> 1;
    merge_sort(a, low, mid);
    merge_sort(a, mid + 1, high);
    int i = low, j = mid + 1,k = 0,q[N];
    while(i <= mid && j <= high){
        if (a[i] <= a[j]) q[k ++] = a[i ++];
        else {
            q[k ++] = a[j ++];
            res += mid - i + 1;
        }
    }
    while(i <= mid) q[k ++] = a[i ++];
    while(j <= high) q[k ++] = a[j ++];
    for(int i = low, k = 0; i <= high; i ++,k ++)
    a[i] = q[k];
    }
}
int main(){
    int n;
    cin>>n;
    for(int i = 0;i < n; i ++)
    cin >> a[i];
    merge_sort(a, 0, n - 1);
    cout<<res;
}