-
Notifications
You must be signed in to change notification settings - Fork 6
/
DQUERY.cpp
99 lines (88 loc) · 1.63 KB
/
DQUERY.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<math.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define INF 1000000
int t,n,q,x,y;
int a[100005],b[100005],tree[100005];
int cur[1000005],r[100005];
bool vis[1000005];
int ans[300000];
vector < pair< pair<int,int>,int > > v;
//Query
int read(int idx)
{
int sum=0;
while(idx>0)
{
sum+=tree[idx];
idx -= (idx & -idx);
}
return sum;
}
//Update
void update(int idx,int val)
{
while(idx<=n)
{
tree[idx]+=val;
idx += (idx & -idx);
}
}
int main()
{
//freopen("input.txt","r",stdin);
memset(cur,INF,sizeof(cur));
scanf("%d",&n);
//Initialize the tree
a[0]=tree[0]=0;
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
for(int i=n;i>0;i--)
{
r[i]=cur[a[i]];
cur[a[i]]=i;
}
for(int i=1;i<=n;i++)
{
if(!vis[a[i]])
{
b[i]=b[i-1]+1;
vis[a[i]]=true;
}
else
b[i]=b[i-1];
tree[i]=b[i]-b[i-(i & -i)];
}
//Get and Sort Queries
scanf("%d",&q);
for(int i=0;i<q;i++)
{
scanf("%d%d",&x,&y);
v.pb(mp(mp(x,y),i));
}
sort(v.begin(),v.end());
//Query and Update
int pos=0;
for(int i=1;i<=n;i++)
{
while((v[pos].X).X==i)
{
ans[(v[pos].Y)]=read((v[pos].X).Y);
pos++;
}
update(i,-1); //Unmark
update(r[i],1); //Mark
}
for(int i=0;i<q;i++)
cout<<ans[i]<<"\n";
}