D-query (初学离线的dd)
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
题目大意为给定一组数,给定几组区间,求其不同数字个数之和。
解题思路
1、树状数组以及离线处理:
可以通过开一个结构体,记录左右端点值以及询问的次序,将每次询问的右端点进行处理排序(由小到大),然后设置一个变量cur(对数组进行逐块处理),通过每个数的位置建立树状数组(当前区间元素的种类数)。从左至右依次遍历,遍历一个区间,计算一个答案,每次再把前面出现过的数往r靠拢,避免出现重复。
#include<cstdio>
#include<map>
#include<cstring>
#include<algorithm>
#define maxn 303000
using namespace std;
map<int ,int >mp;
int tr[maxn<<2],a[maxn],ans[maxn];
struct node{
int l,r,id;
}p[maxn];
int n;
bool cmp(node a,node b)
{
return a.r<b.r;
}
int lowbit(int x)//遍历根节点或子节点
{
return x&(-x);
}
void add(int x,int val)
{
while(x<=n){
tr[x]+=val;
x+=lowbit(x);
}
}
int sol(int x)
{
int res=0;
while(x)
{
res+=tr[x];
x-=lowbit(x);
}
return res;
}
int main()
{
while(~scanf("%d",&n))
{
memset(ans,0,sizeof(ans));
memset(tr,0,sizeof(tr));
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
int q;
scanf("%d",&q);
for(int i=1;i<=q;i++){
scanf("%d%d",&p[i].l,&p[i].r);
p[i].id=i;
}
sort(p+1,p+1+q,cmp);
int cur=1;
for(int i=1;i<=q;i++){
for(int j=cur;j<=p[i].r;j++){
if(mp.find(a[j])!=mp.end()){//检查此数是否出现过,出现则减去影响的根节点
add(mp[a[j]],-1);
}
mp[a[j]]=j;
add(j,1);//对根节点进行新一轮的更新
}
cur=p[i].r+1;//对每次查询进行区间访问
ans[p[i].id]=sol(p[i].r)-sol(p[i].l-1);
}
for(int i=1;i<=q;i++)printf("%d\n",ans[i]);
}
return 0;
}