Dynamic len(set(a[L:R])) UVA - 12345 【分块】

俩操作， 一是单点修改，二是求区间内不同数的个数。

用了黄老师的板子， 结果T了

纠结纠结就发现是change写的不够优秀，套上别人的就过了。

#include <bits/stdc++.h>
#define ms(x) memset(x, 0, sizeof(x))
#define inx 0x7fffffff
#define ll long long
#define Mid  int mid=(l+r)>>1
using namespace std;
const int N = 50007;
const int M = 1e6+1;
int n, q, m, block;
int c[N], pos[N], pre[N], b[N], last[M];
int Find(int x, int v){
    int l = (x-1)*block+1, r = min(x*block, n);
    int first = l;
    while(l<=r){
        //Mid;
        int mid=(l+r)>>1;
        if(pre[mid]<v) l = mid+1;
        else r = mid-1;
    }
    return l - first;
}
void reset(int x){
    int l = (x-1)*block+1, r = min(x*block, n);
    for(int i=l;i<=r;i++) pre[i] = b[i];
    sort(pre+l, pre+r+1);
}
void build(){
    for(int i=1;i<=n;i++){
        b[i] = last[c[i]];
        last[c[i]]=i;
        pos[i] = (i-1)/block+1;
    }
    for(int i=1;i<=m;i++) reset(i);
}
int ask(int l, int r){
    int ans = 0;
    if(pos[l] == pos[r]){
        for(int i=l;i<=r;i++) if(b[i]<l) ans++;
    }
    else{
        for(int i=l;i<=block*pos[l];i++)
            if(b[i]<l) ans++;
        for(int i=block*(pos[r]-1)+1;i<=r;i++)
            if(b[i]<l) ans++;
    }
    for(int i=pos[l]+1;i<pos[r];i++) ans+=Find(i, l);
    return ans;
}
void change(int x, int v){
    if(c[x] == v) return ;
    for(int i=1;i<=n;i++)
        last[c[i]] = 0;
    c[x] = v;
    for(int i=1;i<=n;i++){
        int t = b[i];
        b[i] = last[c[i]];
        if(t!=b[i]) reset(pos[i]);
        last[c[i]] = i;
    }
}
void update(int x, int v)
{
    if(c[x] == v) return;
    int idx = -1, idv = -1;
    for(int i = x+1; i <= n; i++)
    {
        if(c[i] == c[x] && idx == -1) idx = i;
        else if(c[i] == v && idv == -1) idv = i;

        if(idx != -1 && idv != -1) break;
    }
    if(idv != -1) b[idv] = x, reset(pos[idv]);
    idv = x;
    for(int i = x-1; i >= 1; i--)
    {
        if(c[i] == c[x] && idx != -1) b[idx] = i, reset(pos[idx]), idx = -1;
        if(c[i] == v && idv != -1) b[idv] = i, reset(pos[idv]), idv = -1;
        if(idx == -1 && idv == -1) break;
    }
    if(idx != -1) b[idx] = 0, reset(pos[idx]);
    if(idv != -1) b[idv] = 0, reset(pos[idv]);
    c[x] = v;
}
int main(){
    scanf("%d%d", &n, &q);
    for(int i=1;i<=n;i++) scanf("%d", &c[i]);
    //block = int(sqrt(n));                       //块大小
    block=int(sqrt(n));
    if(n%block) m = n/block+1;                  //m块的个数
    else m = n/block;
    build();
    char quer[8];
    int x, y;
    for(int i=1;i<=q;i++){
        scanf("%s%d%d", quer, &x, &y);
        if(quer[0] == 'Q') printf("%d\n", ask(x+1, y));
        else update(x+1, y);
    }
    return 0;
}