逆序对模板

逆序对

摘自百度并进行了部分修改。

归并排序

#include <bits/stdc++.h>

using namespace std;

// [l, r)
void merge_inversion(vector<int> &nums, int l, int r, int &cnt) {
    cout << l << " - " << r << endl;
    // 只有一个元素直接返回
    if (r - l <= 1) return;

    // 分治
    int m = l + (r - l) / 2;
    merge_inversion(nums, l, m, cnt);
    merge_inversion(nums, m, r, cnt);

    // 归并, 按照从大到小的顺序。
    int i = l;
    int j = m;
    vector<int> temp;
    for (int k = l; k < r; ++k) {
        if (i < m && j < r) {
            if (nums[i] > nums[j]) {
                cnt += (r - j);
                temp.push_back(nums[i++]);
            } else {
                temp.push_back(nums[j++]);
            }
        } else {
            if (i < m) {
                temp.push_back(nums[i++]);
            } else if (j < r) {
                temp.push_back(nums[j++]);
            }
        }
    }
    for (int k = l; k < r; ++k) {
        nums[k] = temp[k - l];
    }
}

int main() {
    vector<int> nums = {1, 7, 2, 5, 8, 10, 6};
    int ans = 0;
    merge_inversion(nums, 0, nums.size(), ans);
    cout << ans << endl;
    for (int i = 0; i < nums.size(); ++i) {
        cout << nums[i] << " ";
    }
    cout << endl;
    return 0;
}

树状数组

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

#define ll long long
using namespace std;
const int maxn = 1e6 + 10;
ll n, m, A[maxn], B[maxn], ans, L[maxn];

struct BIT {
    ll tree[maxn];

    ll lowbit(ll x) {
        return x & -x;
    }

    void update(ll pos, ll val) {
        while (pos <= n) {
            tree[pos] += val;
            pos += lowbit(pos);
        }
    }

    ll query(ll pos) {
        ll res = 0;
        while (pos) {
            res += tree[pos];
            pos -= lowbit(pos);
        }
        return res;
    }
} T;

int Search(ll x) {
    return lower_bound(B + 1, B + 1 + m, x) - B;
}

int main() {
    scanf("%lld", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%lld", &A[i]), B[i] = A[i];
    }
    sort(B + 1, B + 1 + n);
    m = unique(B + 1, B + 1 + n) - B - 1;
    for (int i = 1; i <= n; i++) {
        A[i] = Search(A[i]);
        T.update(A[i], 1);
        L[i] = i - T.query(A[i]);
        ans += L[i];
    }
    printf("%lld", ans);
    return 0;
}