SPOJ - DQUERY

D-query

 SPOJ - DQUERY 

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 

题目大意： 求区间不同数的个数

题解：可以考虑用树状数组离线处理（离线处理就转化为右端点固定的区间查询问题，如果该数字在区间内多次出现，只有最右端的数字是有效的）或者是用主席书离线处理

另外一种离线的处理方法就是刚刚学习的莫队算法

另外：注意题目数据范围！注意题目数据范围！注意题目数据范围！

因为数组开太小的原因，re了3次

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
#define sca(x) scanf("%d",&x)
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define N 30005
int len;
int c[N];
int ans=0;
struct node
{
    int l,r,id,blo;
    node(){}
    node(int L,int R,int I):l(L),r(R),id(I){blo=L/len;}
    friend bool operator < (node x,node y)
    {
        return x.blo==y.blo?x.r<y.r:x.blo<y.blo;
    }
}a[200005];
int sum[1000005],pri[200005];

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

void sub(int x)
{
    sum[c[x]]--;
    if(sum[c[x]]==0)ans--;
}
int main()
{
    int n,m;
    sca(n);
    len=(int)(sqrt(n));
    rep(i,1,n)
    {
        sca(c[i]);
    }
    sca(m);
    rep(i,1,m)
    {
        int l,r;
        sca(l),sca(r);
        a[i]=node(l,r,i);
    }
    sort(a+1,a+1+m);
    int L=1,R=0;
    rep(i,1,m)
    {
        while(R<a[i].r)add(++R);
        while(R>a[i].r)sub(R--);
        while(L>a[i].l)add(--L);
        while(L<a[i].l)sub(L++);
        pri[a[i].id]=ans;
    }
    rep(i,1,m)printf("%d\n",pri[i]);
}