Acwing #788(逆序对的数量)

#include <iostream>
using namespace std;
const int MAXN = 100005;
typedef long long LL;
int value[MAXN];
int temp[MAXN];
LL res; //保存答案,全局变量默认为0
void merge_short(int l, int r) {
    if(l >= r) {
        return ;
    }
    int mid = (l + r) >> 1;
    merge_short(l, mid);
    merge_short(mid + 1, r);
    int i = l, k = l, j = mid + 1;
    while(i <= mid && j <= r) {
        if(value[i] <= value[j]) {  
            temp[k++] = value[i++];
        }else { //value[i]和value[j]为逆序对,且value[i~mid]都和value[j]组成一个逆序对
            res += mid - i + 1;
            temp[k++] = value[j++];
        }
    }
    while(i <= mid) {
        temp[k++] = value[i++];
    }
    while(j <= r) {
        temp[k++] = value[j++];
    }
    for(int i = l; i <= r; i++) {
        value[i] = temp[i];
    }
}
int main() {
    res = 0;
    int n;
    cin >> n;
    for(int i = 0; i < n; i++) {
        cin >> value[i];
    }
    merge_short(0, n-1);
    cout << res << endl;
    return 0;
}