首先观察一下每次修改后对答案的影响
我们不妨令f[i]表示i 与i-n形成的逆序对个数
每次提出来的数的逆序对贡献变成0, 没有提出来的数逆序对个数不变
因为每次提出来的大于等于一个数的都会在它的后面, 而没有提出来的后面该有多少还有多少
因此我们每次暴力找到x-n f[i]不为0且权值比a[x]小的并修改, 因为每个数最多修改一次,所以均摊是nlogn
#include<bits/stdc++.h>
#define N 500050
#define LL long long
using namespace std;
int read(){
int cnt=0;char ch=0;
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))cnt=cnt*10+(ch-'0'),ch=getchar();
return cnt;
}
int n,m; LL ans;
int a[N],b[N],siz;
int c[N],f[N];
void add(int x,int val){ for(;x<=n;x+=x&-x) c[x] += val;}
int ask(int x){int ans=0; for(;x;x-=x&-x) ans += c[x]; return ans;}
struct Segmentree{
int l,r,pos;
}t[N<<2];
void Pushup(int x){
if(a[t[x<<1].pos] <= a[t[x<<1|1].pos]) t[x].pos = t[x<<1].pos;
else t[x].pos = t[x<<1|1].pos;
}
void Build(int x,int l,int r){
t[x].l = l, t[x].r = r;
if(l==r){ t[x].pos = l; return;}
int mid = (l+r) >> 1;
Build(x<<1, l, mid); Build(x<<1|1, mid+1, r);
Pushup(x);
}
void Update(int x,int pos){
if(t[x].l==t[x].r){ t[x].pos = 0; return;}
int mid = (t[x].l + t[x].r) >> 1;
if(pos<=mid) Update(x<<1, pos);
else Update(x<<1|1, pos);
Pushup(x);
}
int Quary(int x,int L,int R){
if(L<=t[x].l && t[x].r<=R) return t[x].pos;
int mid = (t[x].l+t[x].r) >> 1;
if(L>mid) return Quary(x<<1|1, L, R);
else if(R<=mid) return Quary(x<<1, L, R);
else{
int p1 = Quary(x<<1, L, R);
int p2 = Quary(x<<1|1, L, R);
return a[p1] <= a[p2] ? p1 : p2;
}
}
int main(){
n = read(), m = read(); a[0] = N;
for(int i=1;i<=n;i++) a[i] = b[i] = read();
sort(b+1, b+n+1); siz = unique(b+1, b+n+1) - (b+1);
for(int i=n;i>=1;i--){
a[i] = lower_bound(b+1, b+siz+1,a[i]) - b;
f[i] = ask(a[i]-1); add(a[i],1); ans += (LL)f[i];
} Build(1,1,n); printf("%lld\n",ans);
while(m--){
int x = read(), Pos = Quary(1,x,n);
int tmp = a[x];
while(a[Pos] <= tmp){
ans -= (LL)f[Pos]; a[Pos] = N; f[Pos] = 0;
Update(1,Pos); Pos = Quary(1,x,n);
} printf("%lld\n",ans);
} return 0;
}