[BZOJ2120] 带修改莫队

[BZOJ2120]

• 查询区间内不同数个数，带修改
• O(n^1.666)

Code

---

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int N=1e4+10;
struct Q{int l,r,t,id;}q[N];
int last[N],num[N*100],pos[N],pre[N],now[N],AC[N],v[N],a[N],blo,ans,tot,l,r,T,n,m;
char s;
int read(){
	int num=0;char ch=getchar();
	while(!isdigit(ch))ch=getchar();
	while(isdigit(ch))num=num*10+ch-'0',ch=getchar();
	return num;
}
void Print(int x){if(x>9)Print(x/10);putchar(x%10+'0');}
bool cmp(Q a,Q b){return (a.l/blo==b.l/blo&&a.r<b.r)||a.l/blo<b.l/blo;}
void cal(int x){
	if(v[x]){
		num[a[x]]--;
		if(num[a[x]]==0)ans--;
	}else{
		num[a[x]]++;
		if(num[a[x]]==1)ans++;
	}v[x]^=1;
} 
void work(int x,int val){
	if(v[x]){
		cal(x);
		a[x]=val;
		cal(x);
	}else a[x]=val;
}
int main()
{
	//freopen("a.in","r",stdin);
	n=read(),m=read(); blo=sqrt(n);
	rep(i,1,n)a[i]=read(),last[i]=a[i];
	rep(i,1,m){
		cin>>s; l=read(),r=read();
		if(s=='Q'){
			q[++tot].l=l,q[tot].r=r,q[tot].t=T,q[tot].id=tot;
		}else{
			pre[++T]=last[l],now[T]=r,last[l]=r,pos[T]=l;
		}
	}
	sort(q+1,q+tot+1,cmp);
	l=1,r=0;
	rep(i,1,tot){
		for(int j=q[i-1].t+1;j<=q[i].t;j++)work(pos[j],now[j]);
		for(int j=q[i-1].t;j>q[i].t;j--)work(pos[j],pre[j]);
		while(l<q[i].l)cal(l++);
		while(l>q[i].l)cal(--l);
		while(r>q[i].r)cal(r--);
		while(r<q[i].r)cal(++r);
		AC[q[i].id]=ans;
	}
	rep(i,1,tot)Print(AC[i]),puts("");
	return 0;
}