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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
|
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
long long read()
{
long long x=0,f=1; char c=getchar();
while(!isdigit(c)){if(c=='-') f=-1;c=getchar();}
while(isdigit(c)){x=x*10+c-'0';c=getchar();}
return x*f;
}
const int N=50000+100;
const int Q=225+20;
struct SegmentTree
{
#define lson (now<<1)
#define rson (now<<11)
#define mid ((now_l+now_r)>>1)
int sum[N<<2];
inline void update(int now)
{
sum[now]=sum[lson]+sum[rson];
}
void Add(int x,int num,int now,int now_l,int now_r)
{
if(now_l==now_r)
{
sum[now]+=num;
return;
}
if(x<=mid) Add(x,num,lson,now_l,mid);
else Add(x,num,rson,mid+1,now_r);
update(now);
}
int Query(int l,int r,int now,int now_l,int now_r)
{
if(now_l>=l and now_r<=r)
return sum[now];
int t_ans=0;
if(l<=mid) t_ans+=Query(l,r,lson,now_l,mid);
if(r>mid) t_ans+=Query(l,r,rson,mid+1,now_r);
return t_ans;
}
#undef lson
#undef rson
#undef mid
}sgt;
struct PresidentTree
{
#define mid ((now_l+now_r)>>1)
static const int M=(50000<<2)*30;
int sum[M],son[M][2],to;
inline void update(int now)
{
sum[now]=sum[son[now][0]]+sum[son[now][1]];
}
void Add(int x,int now,int pre,int now_l,int now_r)
{
if(now_l==now_r)
{
sum[now]=sum[pre]+1;
return;
}
if(x<=mid)
{
Add(x,son[now][0]=++to,son[pre][0],now_l,mid);
son[now][1]=son[pre][1];
}
else
{
Add(x,son[now][1]=++to,son[pre][1],mid+1,now_r);
son[now][0]=son[pre][0];
}
update(now);
}
int Query(int l,int r,int now,int pre,int now_l,int now_r)
{
if(now_l>=l and now_r<=r) return sum[now]-sum[pre];
int t_ans=0;
if(l<=mid) t_ans+=Query(l,r,son[now][0],son[pre][0],now_l,mid);
if(r>mid) t_ans+=Query(l,r,son[now][1],son[pre][1],mid+1,now_r);
return t_ans;
}
#undef mid
}prt;
struct NUM
{
int w,no;
}num[N];
bool cmp(NUM x, NUM y)
{
return x.w>y.w;
}
bool cmp2(NUM x,NUM y)
{
return x.no<y.no;
}
int t_a[N],n,m,block,cnt[Q],msize[Q];
int f[Q][Q],g[Q][Q],root[N];
int main()
{
int t=clock();
freopen("3744.in","r",stdin);
freopen("3744.out","w",stdout);
n=read();
for(int i=1;i<=n;i++)
num[i].w=t_a[i]=read(),num[i].no=i;
sort(t_a+1,t_a+1+n);
m=unique(t_a+1,t_a+1+n)-t_a-1;
for(int i=1;i<=n;i++)
num[i].w=lower_bound(t_a+1,t_a+1+m,num[i].w)-t_a;
sort(num+1,num+1+n,cmp);
int size=int(sqrt(n));
msize[0]=size-1,msize[n/size]=n%size+1;
for(int i=1;i<n/size;i++)
msize[i]=size;
block=n/size;
for(int i=1;i<=n;i++)
sgt.Add(i,1,1,1,n);
static int mqueue[N],tail;
int to=0;
while(to<n)
{
tail=0;
for(to++;to<=n;to++)
{
sgt.Add(num[to].no,-1,1,1,n);
cnt[num[to].no/size]++;
mqueue[tail++]=to;
if(num[to+1].w != num[to].w)
break;
}
for(int t=0;t<tail;t++)
{
int i=mqueue[t];
for(int j=num[i].no/size+1;j<=block;j++)
f[j][num[i].no/size]+=msize[j]-cnt[j],
f[num[i].no/size][j]+=msize[j]-cnt[j];
f[num[i].no/size][num[i].no/size]+=sgt.Query(num[i].no,(num[i].no/size+1)*size-1,1,1,n);
}
}
for(int i=0;i<=block;i++)
{
g[i][i]=f[i][i];
for(int j=i+1;j<=block;j++)
g[i][j]+=g[i][j-1]+f[i][j];
}
sort(num+1,num+1+n,cmp2);
for(int i=1;i<=n;i++)
{
root[i]=++prt.to;
prt.Add(num[i].w,root[i],root[i-1],0,m);
}
int q=read(),ans=0;
for(int i=1;i<=q;i++)
{
int l=read()^ans,r=read()^ans;
ans=0;
for(int j=l;j<min((l/size+1)*size,r+1);j++)
ans+=prt.Query(0,num[j].w-1,root[r],root[j],0,m);
if(l/size+1 <= r/size-1)
for(int j=l/size+1;j<=r/size-1;j++)
ans+=g[j][r/size-1];
if(l/size!=r/size)
for(int j=r/size*size;j<=r;j++)
{
ans+=prt.Query(0,num[j].w-1,root[r],root[j],0,m);
if(l/size+1 <= r/size-1)
ans+=prt.Query(num[j].w+1,m,root[r/size*size-1],root[(l/size+1)*size-1],0,m);
}
printf("%d\n",ans);
}
cerr<<clock()-t;
return 0;
}
|
