分治法求逆序对个数(归并排序)

#include <bits/stdc++.h> #define ll long long #define INF 0x3f3f3f3f using namespace std; const int maxn = 1e4; int n; int a[maxn], t[maxn]; void read() { cin >> n; for(int i = 0; i < n; ++i)

>>阅读原文<<