DQUERY - D-query 莫队模版题

Given a sequence of n numbers a1, a2, …, an and a number of d-queries. A d-query is a pair (i, j) (1 ≤ i ≤ j ≤ n). For each d-query (i, j), you have to return the number of distinct elements in the subsequence ai, ai+1, …, aj.

Input

Line 1: n (1 ≤ n ≤ 30000).
Line 2: n numbers a1, a2, …, an (1 ≤ ai ≤ 106).
Line 3: q (1 ≤ q ≤ 200000), the number of d-queries.
In the next q lines, each line contains 2 numbers i, j representing a d-query (1 ≤ i ≤ j ≤ n).
Output

For each d-query (i, j), print the number of distinct elements in the subsequence ai, ai+1, …, aj in a single line.
Example

Input
5
1 1 2 1 3
3
1 5
2 4
3 5

Output
3
2
3
Submit solution!

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <math.h>
using namespace std;
typedef  long long ll;
const int maxn = 1e6 + 7;
struct cnode
{
    int id, l , r;
}query[maxn];
int pos[maxn];
int a[maxn];
bool  cmp(const cnode & a, const cnode &b)
{
    if(pos[a.l] == pos[b.l])
        return  a.r < b.r;
    return pos[a.l] < pos[b.l];
}
ll ans[maxn];
ll ans1[maxn];
int flag[maxn];
int l = 1, r = 0;
ll Ans = 0;

void del (int x)
{
    flag[a[x]]--;
    if(flag[a[x]] == 0)
        Ans--;
}

void add(int x)
{
    Ans += flag[a[x]];
    if(flag[a[x]] == 1)
        Ans++;
}

int main()

{
    int n, m;
    scanf("%d",&n);
    int sz = sqrt(n);
    for(int i = 1; i <= n; i++)
    {
        scanf("%d",&a[i]);
        pos[i] = i / sz;
    }
    scanf("%d",&m);
    for(int i = 1; i <= m; i++)
    {
        scanf("%d %d",&query[i].l,&query[i].r);
        query[i].id = i;
        
    }
    sort(query + 1, query + 1 + m, cmp);
    for(int i = 1; i <= m; i++)
    {
        while(r < query[i].r)
        {
            r++;
            add(r);
        }
        while(r > query[i].r)
        {
            del(r);
            r--;
        }
        while(l > query[i].l)
        {
            del(l);
            l--;
        }
        while(l < query[i].l)
        {
            add(l);
            l++;
        }
        
        ans[query[i].id] = Ans;
    }
    for(int i = 1; i <= m; i++)
        
        printf("%lld\n",ans[i]);
    
    return 0;
    
}