bzoj 1878: [SDOI2009]HH的项链（莫队算法）

莫队入门题

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 5e4+10;
const int MAXM = 2e5+10;
struct node
{
    int l,r,id;
};
node ns[MAXM];
int cnt[1001000];
int Belong[MAXN];
int num[MAXN];
int res[MAXM];
int block,siz;
int n,m,ans = 0;;
int L,R;

bool cmp(const node& a, const node& b)
{
    if(Belong[a.l] == Belong[b.l])
        return a.r < b.r;
    return Belong[a.l] < Belong[b.l];
}

void add(int x)
{
    cnt[num[x]]++;
    if(cnt[num[x]] == 1)
        ++ans;
}

void del(int x)
{
    cnt[num[x]]--;
    if(cnt[num[x]] == 0)
        --ans;
}

int main()
{
    scanf("%d",&n);
    block = sqrt(n);
    siz = n/block;
    if(n%block) ++siz;
    for(int i = 1; i <= n; ++i)
    {
        scanf("%d",&num[i]);
        Belong[i] = (i-1)/block+1;
    }
    scanf("%d",&m);
    for(int i = 1; i <= m; ++i)
    {
        scanf("%d %d",&ns[i].l,&ns[i].r);
        ns[i].id = i;
    }
    sort(ns+1,ns+1+m,cmp);
    L = 1;
    R = 0;
    for(int i = 1; i <= m; ++i)
    {
        while(L < ns[i].l)
        {
            del(L);
            L++;
        }
        while(L > ns[i].l)
        {
            L--;
            add(L);
        }
        while(R < ns[i].r)
        {
            R++;
            add(R);
        }
        while(R > ns[i].r)
        {
            del(R);
            R--;
        }
        res[ns[i].id] = ans;
    }
    for(int i = 1; i <= m; ++i)
        printf("%d\n",res[i]);
    return 0;
}