SPOJ DQUERY

Description

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个点，q个询问，问[I,j]之间不同数的个数。

题解:

离线或者在线，离线的话跟HDU3333很像，可以在我blog翻一下，这里给出代码。

代码；

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#define mem(a) memset(a, 0, sizeof(a))
#define M 200010
#define N  30005
using namespace std;
map<int,int> mp;
int t,n,m;
int rre[M];
int f[N];
int a[N];
struct node
{
    int l,r,id;
    bool operator<(const node &n)const
    {
        return r<n.r;
    }
} qu[M];
inline int lowbit(int x)
{
    return x&(-x);
}
inline void add(int x,int y)
{
    while(x<=n)
    {
        f[x]+=y;
        x+=lowbit(x);
    }
}
inline  int  sum(int x)
{
    int  ans=0;
    while(x)
    {
        ans+=f[x];
        x-=lowbit(x);
    }
    return ans;
}
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
    mem(f);
    for(int i=1; i<=n; i++)
        scanf("%d",&a[i]);
    scanf("%d",&m);
    for(int i=0; i<m; i++)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        qu[i]=(node){x,y,i};
    }
    sort(qu,qu+m);
    int cur=1;
    mp.clear();
    for(int i=0; i<m; i++)
    {
        for(int j=cur; j<=qu[i].r; j++)
        {
            if(mp.find(a[j])!=mp.end())
            {
                add(mp[a[j]],-1);
            }
            add(j,1);
            mp[a[j]]=j;
        }
        cur=qu[i].r+1;
        rre[qu[i].id]=sum(qu[i].r)-sum(qu[i].l-1);
    }
    for(int i=0; i<m; i++)
        printf("%d\n",rre[i]);
    }
    return 0;
}

在线的话就是主席树.

代码：

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <map>
using namespace std;
const int MAX=30030;
int a[MAX],root[MAX];
struct{int l,r,sum;}T[MAX*40];
int cnt=0;  
void update(int l,int r,int &x,int y,int pos,int v)
{
    T[++cnt]=T[y],x=cnt,T[cnt].sum+=v;
    if(l==r)
        return ;
    int mid=(r+l)>>1;
    if(pos<=mid)
    {
        update(l,mid,T[cnt].l,T[y].l,pos,v);
    }
    else
        update(mid+1,r,T[cnt].r,T[y].r,pos,v);
}
int query(int l,int r,int x,int pos)
{
    if(l==r)
        return T[x].sum;
    int mid=(r+l)>>1;
    if(pos<=mid)
    {
        return query(l,mid,T[x].l,pos)+T[T[x].r].sum;
    }
    return query(mid+1,r,T[x].r,pos);
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    map<int ,int >mp;
    for(int i=1;i<=n;i++)
    {
        if(mp[a[i]]==0)
            update(1,n,root[i],root[i-1],i,1);
        else
        {
            int tmp;
            update(1,n,tmp,root[i-1],mp[a[i]],-1);
            update(1,n,root[i],tmp,i,1);
        }
        mp[a[i]]=i;
    }
    int q;
    scanf("%d",&q);
    while(q--)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        printf("%d\n",query(1,n,root[y],x));
    }
    return 0;
}