bzoj2120（带修莫队）

版权声明：写了自己看的，看不懂不能怪我emmmm。 https://blog.csdn.net/qq_40858062/article/details/82021481

题目链接：https://www.lydsy.com/JudgeOnline/problem.php?id=2120

思路：带修莫队的模板题

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%I64d",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(998244353)
#define pb push_back
#define eps 1e-6
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
struct as{
int l,r,d,t,s;}d[10008];
struct ass{
int a,b,c;}e[10008];
int n,m,b[10008],a[10008],zz,now[10008],x,y,t,tt,qw[1000008],sum,l=1,r=0,T=0;
char q;
bool cmp(as a,as c){return b[a.l]==b[c.l]?(b[a.r]==b[a.r]?a.t<c.t:a.r<c.r):a.l<c.l;}
bool cmp1(as a,as b){return a.d<b.d;}
void add(int x,int y)
{
    qw[x]+=y;
    if(y>0&&qw[x]==1) sum++;
    if(y<0&&qw[x]==0) sum--;
}
void add1(int x,int y){if(l<=x&&x<=r)add(y,1),add(a[x],-1);a[x]=y;}
int main()
{
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m;
    zz=pow(n,0.666666);
    FOR(i,1,n) si(a[i]),b[i]=i/zz+1,now[i]=a[i];
    FOR(i,1,m)
    {
        cin>>q,si(x),si(y);
        if(q=='Q') d[++t]=as{x,y,t,tt};
        else e[++tt]=ass{x,y,now[x]},now[x]=y;
    }
    sort(d+1,d+t+1,cmp);
    FOR(i,1,t)
    {
        while(T<d[i].t) add1(e[T+1].a,e[T+1].b),T++;
        while(T>d[i].t) add1(e[T].a,e[T].c),T--;
        while(l<d[i].l) add(a[l],-1),l++;
        while(l>d[i].l) add(a[l-1],1),l--;
        while(r<d[i].r) add(a[r+1],1),r++;
        while(r>d[i].r) add(a[r],-1),r--;
        d[i].s=sum;
    }
    sort(d+1,d+t+1,cmp1);
    FOR(i,1,t)
     printf("%d\n",d[i].s);
    return 0;
}