[BZOJ2120] 数颜色 && [bzoj2453] 维护队列（莫队 || 分块）

传送门

只有第一个，第二个权限题。

分块，然而wa，没看出来错在哪里，有时间再看。

 #include <cmath>
 #include <cstdio>
 #include <iostream>
 #include <algorithm>
 
 const int N = , M = ;
 
 int n, m, S, C;
 int a[N], st[N], ed[N], belong[N], pre[N], last[M], c[N];
 
 inline int read()
 {
     int x = , f = ;
     char ch = getchar();
     for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -;
     for(; isdigit(ch); ch = getchar()) x = (x << ) + (x << ) + ch - '';
     return x * f;
 }
 
 inline int min(int x, int y)
 {
     return x < y ? x : y;
 }
 
 inline int find(int x, int y, int z)
 {
     int mid, l = x;
     while(x < y)
     {
         mid = (x + y) >> ;
         if(c[mid] >= z) y = mid;
         else x = mid + ;
     }
     return x - l;
 }
 
 inline void reset(int x)
 {
     int i;
     for(i = st[x]; i <= ed[x]; i++) c[i] = pre[i];
     std::sort(c + st[x], c + ed[x] + );
 }
 
 inline void init()
 {
     int i, j;
     n = read();
     m = read();
     S = sqrt(n);
     for(i = ; i <= n; i++)
     {
         a[i] = read();
         pre[i] = last[a[i]];
         last[a[i]] = i;
     }
     for(i = ; i <= n; i += S)
         st[++C] = i, ed[C] = min(i + S - , n);
     for(i = ; i <= C; i++)
     {
         reset(i);
         for(j = st[i]; j <= ed[i]; j++) belong[j] = i;
     }
 }
 
 inline int query(int x, int y)
 {
     int i, l = belong[x], r = belong[y], ans = ;
     if(l == r)
     {
         for(i = x; i <= y; i++) if(c[i] < x) ans++;
         return ans;
         //return std::lower_bound(c + x, c + y + 1, x) - c - x;
     }
     //ans += std::lower_bound(c + x, c + ed[l] + 1, x) - c - x;
     for(i = x; i <= ed[l]; i++) if(c[i] < x) ans++;
     for(i = l + ; i <= r - ; i++) ans += find(st[i], ed[i] + , x);
     //ans += std::lower_bound(c + st[r], c + y + 1, x) - c - st[r];
     for(i = st[r]; i <= y; i++) if(c[i] < x) ans++;
     return ans;
 }
 
 inline void update(int x, int d)
 {
     int i, t;
     for(i = ; i <= n; i++) last[a[i]] = ;
     a[x] = d;
     for(i = ; i <= n; i++)
     {
         t = pre[i];
         pre[i] = last[a[i]];
         if(t ^ pre[i]) reset(belong[i]);
         last[a[i]] = i;
     }
 }
 
 inline void work()
 {
     int i, x, y;
     char ch[];
     for(i = ; i <= m; i++)
     {
         scanf("%s", ch);
         x = read();
         y = read();
         if(ch[] == 'Q') printf("%d\n", query(x, y));
         else update(x, y);
     }
 }
 
 int main()
 {
     init();
     work();
     return ;
 }

莫队

比分块不知道高到哪里去了。

带修改之后真是。。。。

 #include <cmath>
 #include <cstdio>
 #include <iostream>
 #include <algorithm>
 
 const int N = , M = 1e6 + ;
 int n, Q, S, cnt1, cnt2, cur, l = , r, now;
 int a[N], t[N], belong[N], ans[N], c[M];
 
 struct ovo
 {
     int l, r, tim, id;
     ovo(int l = , int r = , int tim = , int id = ) : l(l), r(r), tim(tim), id(id) {}
 }q[N];
 struct qwq
 {
     int p, v, last;
     qwq(int p = , int v = , int last = ) : p(p), v(v), last(last) {}
 }cq[N];
 
 inline int read()
 {
     int x = , f = ;
     char ch = getchar();
     for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -;
     for(; isdigit(ch); ch = getchar()) x = (x << ) + (x << ) + ch - '';
     return x * f;
 }
 
 inline bool cmp(ovo x, ovo y)
 {
     return belong[x.l] == belong[y.l] ? (belong[x.r] == belong[y.r] ? x.tim < y.tim : belong[x.r] < belong[y.r]) : belong[x.l] < belong[y.l];
 }
 
 inline void add(int x)
 {
     now += (++c[x]) == ;
 }
 
 inline void del(int x)
 {
     now -= (--c[x]) == ;
 }
 
 inline void update(int x, int d)
 {
     if(l <= x && x <= r) add(d), del(a[x]);
     a[x] = d;
 }
 
 int main()
 {
     int i, x, y;
     char ch[];
     n = read();
     Q = read();
     S = sqrt(n);
     for(i = ; i <= n; i++) a[i] = t[i] = read(), belong[i] = i / S + ;
     for(i = ; i <= Q; i++)
     {
         scanf("%s", ch);
         x = read();
         y = read();
         if(ch[] == 'Q') q[++cnt1] = ovo(x, y, cnt2, cnt1);
         else cq[++cnt2] = qwq(x, y, t[x]), t[x] = y;
     }
     std::sort(q + , q + cnt1 + , cmp);
     for(i = ; i <= cnt1; i++)
     {
         while(cur < q[i].tim) cur++, update(cq[cur].p, cq[cur].v);
         while(cur > q[i].tim) update(cq[cur].p, cq[cur].last), cur--;
         while(l < q[i].l) del(a[l]), l++;
         while(l > q[i].l) l--, add(a[l]);
         while(r < q[i].r) r++, add(a[r]);
         while(r > q[i].r) del(a[r]), r--;
         ans[q[i].id] = now;
     }
     for(i = ; i <= cnt1; i++) printf("%d\n", ans[i]);
     return ;
 }