SPOJ - DQUERY D-query （莫队）

D-query

 

English

Vietnamese

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 

题目大意：有一个长度为n的数列，有m次查询，每次查询给出 l ，r 问在区间[l ,r]内有多少个不同的数字

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
const int N=200010;
int a[N],ans,c[N*5],b[N];
struct node
{
    int l,r,id,pos;
}q[N];
bool cmp(node a,node b)
{
    if(a.pos==b.pos) return a.r<b.r;
    return a.pos<b.pos;
}
void update(int x,int p)
{
    if(x==0) return;
    if(c[a[x]]) ans-=1;
    c[a[x]]+=p;
    if(c[a[x]]) ans+=1;
}
int main()
{
        int n,m;
        scanf("%d",&n);
        int p=sqrt(n);
        for(int i=1;i<=n;i++) scanf("%d",&a[i]);
        scanf("%d",&m);
        for(int i=0;i<m;i++)
        {
            scanf("%d%d",&q[i].l,&q[i].r);
            q[i].id=i;
            q[i].pos=q[i].l/p;
        }
        sort(q,q+m,cmp);
        int l=0,r=0;
        ans=0;
        for(int i=0;i<m;i++)
        {
            while(l<q[i].l) update(l++,-1);
            while(l>q[i].l) update(--l,1);
            while(r>q[i].r) update(r--,-1);
            while(r<q[i].r) update(++r,1);
            b[q[i].id]=ans;
        }
        for(int i=0;i<m;i++)
            printf("%d\n",b[i]);
    return 0;
}