逆序对(模板)

最新推荐文章于 2024-10-09 22:28:58 发布

「已注销」

最新推荐文章于 2024-10-09 22:28:58 发布

阅读量40

点赞数

文章标签：算法 c++ 数据结构排序算法图论

本文链接：https://blog.csdn.net/LittlePage/article/details/132994060

版权

逆序对板子，我们在求逆序的时候，仅仅需要进行在归并排序上加上 mid - i + 1即可

#include <iostream>
using namespace std;
typedef long long LL;
const int N = 100010;
int n, q[N], tmp[N];
LL merge_sort(int l, int r) {
    if(l >= r) return 0;
    int mid = l + r >> 1;
    LL res = merge_sort(l, mid) + merge_sort(mid + 1, r);

    int k = 0, i = l, j = mid + 1;
    while(i <= mid && j <= r) {
        if(q[i] <= q[j]) tmp[k++] = q[i++];
        else {
            tmp[k++] = q[j++];
            res += mid - i + 1;
        }
    }
    while(i <= mid) tmp[k++] = q[i++];
    while(j <= r) tmp[k++] = q[j++];
    for(int i = l, j = 0; i <= r; i++, j++) q[i] = tmp[j];
    return res;
}
int main() {
    cin >> n;
    for(int i = 0; i < n; i++) cin >> q[i];
    cout << merge_sort(0, n - 1) << endl;
    return 0;
}