2120: 数颜色

https://www.lydsy.com/JudgeOnline/problem.php?id=2120

总结：莫队单点修改，离散查询；加上记录修改的时间变量，暴力时加上处理修改的；

洛谷的数据强，分块要判断(Be[x.l]&1)，很玄学。。。分块要n^(2.0/3.0)~~~

#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back`
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=5e4+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;

    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

struct Mo
{
    int l,r;
    int id;
    int tim;
}q[maxn];
struct change
{
    int pos,nw,od;
}c[maxn];

int Be[maxn];
int col[maxn];
int ans=0;
int n,m;
int now[maxn];
int res[maxn];
int num[maxn*100];//1~n
int cnt=0;
int T;
int l=1;
int r=0;

bool cmp(Mo x,Mo y)
{
    /*if(Be[x.l]==Be[y.l])
    {
        if(Be[x.r]==Be[x.r]) return x.tim<y.tim;

        return x.r<y.r;
    }
    return x.l<y.l;*/

    if(Be[x.l]!=Be[y.l]) return x.l<y.l;
    if(Be[x.r]!=Be[y.r])
    {
        if(Be[x.l]&1) return x.r<y.r;
        else return x.r>y.r;
    }
    return x.tim<y.tim;
}

void solve(int x,int add)
{
    num[x]+=add;
    if(num[x]==1&&add==1) ans++;
    if(num[x]==0&&add==-1) ans--;
}
void rechange(int x,int nw)
{
    if(l<=x&&x<=r)//区间内的才修改ans
    {
        solve(nw,1);
        solve(col[x],-1);
    }
    col[x]=nw;//还原
}
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    //cin>>n>>m;
    n=read();
    m=read();
    //int u=sqrt(n);
    int u=pow(n,2.0/3.0);
    for(int i=1;i<=n;i++) col[i]=read(),Be[i]=i/u+1,now[i]=col[i];
    for(int i=1;i<=m;i++)
    {
        char op[3];
        int x,y;
        //cin>>op;
        scanf("%s",op);
        //cin>>x>>y;
        x=read();
        y=read();
        if(op[0]=='Q')
        {
            cnt++;
            q[cnt].l=x;
            q[cnt].r=y;
            q[cnt].tim=T;
            q[cnt].id=cnt;
        }
        else
        {
            T++;
            c[T].pos=x;
            c[T].od=now[x];
            c[T].nw=y;
            now[x]=y;
        }
    }
    sort(q+1,q+cnt+1,cmp);
    int t=0;
    for(int i=1;i<=cnt;i++)
    {
        while(l<q[i].l) solve(col[l],-1),l++;
        while(l>q[i].l) solve(col[l-1],1),l--;
        while(r<q[i].r) solve(col[r+1],1),r++;
        while(r>q[i].r) solve(col[r],-1),r--;

        while(t<q[i].tim) rechange(c[t+1].pos,c[t+1].nw),t++;
        while(t>q[i].tim) rechange(c[t].pos,c[t].od),t--;
        res[q[i].id]=ans;
    }
    //for(int i=1;i<=cnt;i++) cout<<res[i]<<endl;
    for(int i=1;i<=cnt;i++) printf("%d\n",res[i]);
    return 0;
}