思路:化删除操作为添加操作,用时光倒流的方法来处理。那么可以想象成对于一个序列,往位置 i i i插入一个数字 x x x可以增加的逆序对的数量是多少?
插入的点的贡献分成两部分来算,一部分是在位置i前面比他大的数字可以构成逆序对,另外一部分是在位置i后面比它小的数字也可以构成逆序对。
因此可以把问题看成一个三维偏序的问题,(添加时间,添加位置,添加数值大小)。
因此我们用排序的方法处理一维时间,
c
d
q
cdq
cdq分治处理一维,再用树状数组处理一维,就可以完美解决这个问题了。
#include <bits/stdc++.h>
#define eps 1e-8
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define CLR(x, y) memset((x),y,sizeof(x))
#define fuck(x) cerr << #x << "=" << x << endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int seed = 131;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
const int N = 1e5 + 5;
int n, m;
int a[maxn], b[maxn];
int bit[maxn];
int vis[maxn];
int pos[maxn];
int lowbit(int x) {
return x & -x;
}
void add(int i, int x) {
while (i < N) {
bit[i] += x;
i += lowbit(i);
}
}
int query(int i) {
int sum = 0;
while (i) {
sum += bit[i];
i -= lowbit(i);
}
return sum;
}
struct node {
int t, p, val;
ll ans;
bool operator<(const node &a) const {
return t < a.t;
}
} e[maxn], t[maxn];
ll ans[maxn];
void cdq(int l, int r) {
if (l == r) return;
int mid = (l + r) / 2;
cdq(l, mid);
cdq(mid + 1, r);
int i = l, j = mid + 1;
int cnt = l;
while (i <= mid || j <= r) {
if ((j > r) || (i <= mid && e[i].p < e[j].p)) {
add(e[i].val, 1);
t[cnt++] = e[i++];
} else {
ll sum = (i - l) - query(e[j].val);
e[j].ans += sum;
t[cnt++] = e[j++];
}
}
for (int i = l; i <= mid; i++) {
add(e[i].val, -1);
}
for (int i = l; i <= r; i++) {
e[i] = t[i];
}
}
void cdq2(int l, int r) {
if (l == r) return;
int mid = (l + r) / 2;
cdq2(l, mid);
cdq2(mid + 1, r);
int i = l, j = mid + 1;
int cnt = l;
while (i <= mid || j <= r) {
if ((j > r) || (i <= mid && e[i].p > e[j].p)) {
add(e[i].val, 1);
t[cnt++] = e[i++];
} else {
ll sum = query(e[j].val);
e[j].ans += sum;
t[cnt++] = e[j++];
}
}
for (int i = l; i <= mid; i++) {
add(e[i].val, -1);
}
for (int i = l; i <= r; i++) {
e[i] = t[i];
}
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
pos[a[i]] = i;
}
for (int i = 1; i <= m; i++) {
scanf("%d", &b[i]);
vis[b[i]] = 1;
}
int tmp = m;
for (int i = 1; i <= n; i++) {
if (!vis[i]) b[++tmp] = i;
}
for (int i = n; i >= 1; i--) {
e[i].t = n - i + 1;
e[i].p = pos[b[i]];
e[i].val = b[i];
}
sort(e + 1, e + 1 + n);
cdq(1, n);
CLR(bit, 0);
CLR(t, 0);
sort(e + 1, e + 1 + n);
cdq2(1, n);
sort(e + 1, e + 1 + n);
for (int i = 1; i <= n; i++) {
ans[i] = ans[i - 1] + e[i].ans;
}
for (int i = n; i > n - m; i--) printf("%lld\n", ans[i]);
return 0;
}