Codeforces Round #404 E. Anton and Permutation【树套树】

题目链接

题意

一个序列 $a[1...n]$ 初始 $a[i]=i$，$m$次操作，每次交换 $a[l]$ 和 $a[r]$ ，每次操作完输出当前序列的逆序对数

题解

树状数组套主席树，主席树单点修改，再通过树状数组进行区间修改，维护区间 $[u,v]$ 里，大小在$[x,y]$ 范围内的值的个数

#include<iostream>
#include<sstream>
#include<string>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<vector>
#include<stack>
#include <utility>
#include<list>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<time.h>
#include<random>
using namespace std;
#include<ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
using namespace __gnu_pbds;
#include<ext/rope>
using namespace __gnu_cxx;

#define int long long
#define PI acos(-1.0)
#define eps 1e-9
#define lowbit(a) ((a)&-(a))
#define mid ((l+r)>>1)

const int mod = 1e9+7;
int qpow(int a,int b){
	int ans=1;
	while(b){
		if(b&1)ans=(ans*a)%mod;
		a=(a*a)%mod;
		b>>=1;
	}
	return ans;
}
const int INF = 0x3f3f3f3f;
const int N = 5e5+10;
struct node{
	int l,r;
	int w;
}hjt[N*40];
int cnt,root[N],a[N],n,m;
void insert(int &now,int l,int r,int pos,int val){	
	if(!now)now=++cnt;
	hjt[now].w+=val;
	if(l==r)return;
	if(pos<=mid)insert(hjt[now].l,l,mid,pos,val);
	else insert(hjt[now].r,mid+1,r,pos,val);
}
int query(int now,int l,int r,int ql,int qr){
	if(!now)return 0;
	if(ql<=l&&r<=qr)return hjt[now].w;
	int ans=0;
	if(ql<=mid)ans+=query(hjt[now].l,l,mid,ql,qr);
	if(qr>mid)ans+=query(hjt[now].r,mid+1,r,ql,qr);
	return ans;
}
void bit_insert(int x,int pos,int val){
	for(int i=x;i<=n;i+=lowbit(i))insert(root[i],1,n,pos,val);
}
int bit_query(int pos,int x,int y){
	int ans=0;
	for(int i=pos;i;i-=lowbit(i))ans+=query(root[i],1,n,x,y);
	return ans;
}
#define endl '\n'
signed main(){
	std::ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++)a[i]=i,bit_insert(i,i,1);
	int ans=0;
	while(m--){
		int l,r; cin>>l>>r;
		if(l==r){cout<<ans<<endl; continue;}
		if(l>r)swap(l,r);
		if(a[l]<a[r])ans++;
		else ans--;
		ans+=bit_query(r-1,a[l]+1,n)-bit_query(l,a[l]+1,n);
		ans-=bit_query(r-1,1,a[l]-1)-bit_query(l,1,a[l]-1);
		ans-=bit_query(r-1,a[r]+1,n)-bit_query(l,a[r]+1,n);
		ans+=bit_query(r-1,1,a[r]-1)-bit_query(l,1,a[r]-1);	
		bit_insert(l,a[l],-1);
		bit_insert(l,a[r],1);
		bit_insert(r,a[r],-1);
		bit_insert(r,a[l],1);
		swap(a[l],a[r]);
		cout<<ans<<endl;
	}
}