P1975 [国家集训队]排队 [树状数组套权值线段树]

传送门

要求查区间大于/小于某个数的个数, 单点修改, 树状数组维护区间, 每一个内部节点建一棵权值线段树就好

每次交换时更新一下贡献

---

// 树状数组套权值线段树 
#include<bits/stdc++.h>
#define N 20050
#define LL long long
using namespace std;
int n,m,a[N],b[N],rt[N],tot; LL ans;
struct Node{int ls,rs,val;}t[N*400]; // O(nlogn^2)
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;
}
void Insert(int &x,int l,int r,int pos,int val){
	if(!x) x = ++tot; t[x].val += val;
	if(l==r) return;
	int mid = (l+r) >> 1;
	if(pos<=mid) Insert(t[x].ls, l, mid, pos, val);
	else Insert(t[x].rs, mid+1, r, pos, val);
}
LL Quary(int x,int l,int r,int L,int R){
	if(L<=l && r<=R) return t[x].val;
	int mid = (l+r) >> 1; LL ans = 0;
	if(L<=mid) ans += Quary(t[x].ls, l, mid, L, R);
	if(R>mid) ans += Quary(t[x].rs, mid+1, r, L, R);
	return ans;
}
void add(int x,int val,int k){for(;x<=n;x+=x&-x) Insert(rt[x], 1, n, val, k);}
LL qu(int x,int L,int R){LL ans=0;for(;x;x-=x&-x) ans+=Quary(rt[x], 1, n, L, R);return ans;} 
LL Qu(int l,int r,int L,int R){if(l>r || L>R) return 0;return qu(r, L, R) - qu(l-1, L, R);} 
int main(){
	n = read();
	for(int i=1;i<=n;i++) a[i] = b[i] = read();
	sort(b+1,b+n+1); int siz = unique(b+1,b+n+1) - (b+1);
	for(int i=1;i<=n;i++){
		a[i] = lower_bound(b+1,b+siz+1,a[i]) - b;
		ans += qu(i, a[i]+1, n);// 前i个中大于a[i]的个数 
		add(i, a[i], 1); 
	} 
	printf("%lld\n",ans);
	m = read();
	while(m--){
		int x = read(), y = read();
		// - (x+1 -- y-1 之间大于y的个数) + (x+1 -- y-1 之间小于x的个数) 
		// + (x+1 -- y-1 之间大于x的个数) + (x+1 -- y-1 之间小于y的个数) 
		if(x>y) swap(x,y);
		ans -= Qu(x+1, y-1, a[y]+1, n);
		ans -= Qu(x+1, y-1, 1, a[x]-1);
		ans += Qu(x+1, y-1, a[x]+1, n);
		ans += Qu(x+1, y-1, 1, a[y]-1);
		if(a[x]<a[y]) ans++; if(a[x]>a[y]) ans--;
		add(x, a[x], -1); add(y, a[y], -1);
		swap(a[x],a[y]);
		add(x, a[x], 1); add(y, a[y], 1);
		printf("%lld\n",ans); 
	} return 0;
}