BZOJ3295: [Cqoi2011]动态逆序对 CDQ分治

cdq模板题
把删除操作的时间倒过来就变成了插入，转三维偏序 用和陌上花开一样的方法做就行，而且没有重复元素，不用离散化
插入一个数对答案的贡献要考虑左上角的元素个数与右下的元素个数，做完一次把x，y全部换成n-x+1与n-y+1就可以统计原坐标系中的右下角元素个数了
记得long long

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 100007;
#define ll long long
#define lowbit(_X) ((_X) & (-(_X)))
int n, m;
int read(){
    int s = 0, f = 1; char c = getchar();
    while (c > '9' || c < '0') {if (c == '-') f = -1; c = getchar();}
    while (c >= '0' && c <= '9') { s = s * 10 + c - '0'; c = getchar(); }
    return s * f;
}
struct _{
    int id, x, y, res;
    bool operator < (const _ &rhs) const {
        return id < rhs.id; 
    }
}q[maxn], T[maxn];
ll c[maxn], res[maxn];
void add(int x, ll v) {
    for (int i = x; i <= n; i += lowbit(i)) c[i] += v;
}
ll query(ll x) {
    ll s = 0;
    for (; x; x -= lowbit(x)) s += c[x];
    return s;
}
void cdq(int l, int r) {
    if (l >= r) return;
    int mid = l + r >> 1;
    cdq(l, mid); cdq(mid + 1, r);
    for (int p1 = l, i = l, p2 = mid + 1; i <= r; i++){
        if (p1 <= mid && (p2 > r || q[p1].x < q[p2].x)) add(q[p1].y, 1), T[i] = q[p1++];
        else q[p2].res += query(q[p2].y), T[i] = q[p2++];
    }
    for (int i = l; i <= mid; i++) add(q[i].y, -1);
    for (int i = l; i <= r; i++) q[i] = T[i];
}
int deltime[maxn], cnt;
int main(){
    n = read(), m = read(); cnt  = m;
    for (int i = 1; i <= n; i++) {
        q[i].x = i, q[i].y = read(); q[i].res = 0;
    }
    for (int i = 1; i <= m; i++) {
        int t = read();
        deltime[t] = i;
    }
    for (int i = 1; i <= n; i++) if (!deltime[i]) deltime[i] = ++cnt;
    //q[i].id为插入时间 这样操作后 先删除的变为最后插入的 且原数组中最后未被删除的元素也统计进来了
    for (int i = 1; i <= n; i++) q[i].id = n - deltime[q[i].y] + 1;
    for (int i = 1; i <= n; i++) q[i].x = n - q[i].x + 1;   //求逆序对
    sort(q + 1, q + n + 1);
    cdq(1, n);
    for (int i = 1; i <= n; i++) {
        q[i].x = n - q[i].x + 1; q[i].y = n - q[i].y + 1;
    }
    sort(q + 1, q + n + 1);
    cdq(1, n);
    for (int i = 1; i <= n; i++) res[q[i].id] = q[i].res;
    for (int i = 1; i <= n; i++) res[i] += res[i - 1];
    for (int i = n; i >= n - m + 1; i--) printf("%lld\n", res[i]);
    return 0;
}