洛谷1903 带修莫队

/*洛谷1903

*/ 
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
#include<map>
#include<vector>
#include<set>
#include<queue>
using namespace std;
#define ll long long
const int ding=5e5+5;
int mp[ding],block[ding],l=1,r=0,vis[1000005],ans,sum[ding],no[ding];
struct Alter{
	int id,num,old,nnew;
}alte[ding];
struct Query{
	int id,notime,L,R;
}que[ding];
bool cmp(Query a,Query b){
	if(block[a.L]==block[b.L]){
		if(block[a.R]==block[b.R]){
			return a.notime<b.notime;
		}
		return a.R<b.R;
	}
	return a.L<b.L;
}
bool cmp2(Query a,Query b){
	return a.id<b.id;
}
void revise(int x,int cnt){
	if(cnt==1){
		if(vis[x]==0){
			ans++;
		}vis[x]++;
	}
	else {
		if(vis[x]==1){
			ans--;
		}vis[x]--;
	}
}
void doit(int x,int y){
	if(l<=x&&x<=r){
		revise(mp[x],-1);
		revise(y,1);
	}
	mp[x]=y;
}

int main()
{
 	std::ios::sync_with_stdio(false);
 	int n,m;
 	scanf("%d %d",&n,&m);
 	
		memset(vis,0,sizeof(vis)); 
		int i,t=1,tt=1,L,R,T=1;
		char cc[3];
		const int blo=floor(pow(n,0.666666));//玄学优化 
		for(i=1;i<=n;i++){
			scanf("%d",&mp[i]); 
			no[i]=mp[i];
			block[i]=(i-1)/blo+1;
		}
//		cout<<"mp   "<<mp[61]<<" "<<mp[62]<<" "<<mp[63]<<endl;	
		for(i=1;i<=m;i++){
			scanf("%s %d %d",cc,&L,&R);
			if(cc[0]=='R') {
				alte[t++]=(Alter){t-1,L,no[L],R};
				no[L]=R;//这里要注意一下，每次都要记住 
			}
			else{
				que[tt++]=(Query){tt-1,t,L,R};
			}
		}
		sort(que+1,que+tt,cmp);
		for(i=1;i<tt;i++){//看下当前的时间线是否已经全部修改了
		//然后进行相应的往后往前修改 
			while(T<que[i].notime){
				doit(alte[T].num,alte[T].nnew);
				T++;
			}
			while(T>que[i].notime){
				T--;
				doit(alte[T].num,alte[T].old);
			}
			while(l<que[i].L)revise(mp[l++],-1);
			while(l>que[i].L)revise(mp[--l],1);
			while(r<que[i].R)revise(mp[++r],1);
			while(r>que[i].R)revise(mp[r--],-1);
			sum[que[i].id]=ans;
		}
		sort(que+1,que+tt,cmp2);
		for(i=1;i<tt;i++){
			printf("%d\n",sum[i]);
		}
	
 	

 return 0;
}