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
|
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#include<cstring>
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=100000+100;
const int inf=0x3f3f3f3f;
int a[N],n;
struct BitTree
{
int sum[N*400];
int lowbit(int x)
{
return x&(-x);
}
void Add(int x,int w)
{
int tmp=Query(x,x);
if(tmp==1 and w==0) w=-1;
if(tmp==1 and w==1) w=0;
for(;x<=n;x+=lowbit(x))
sum[x]+=w;
}
int query(int x)
{
int t_ans=0;
for(;x>=1;x-=lowbit(x))
t_ans+=sum[x];
return t_ans;
}
int Query(int l,int r)
{
return query(r)-query(l-1);
}
}bit;
struct OP
{
int l,r,x,no;
}op[N];
struct OP2
{
int l,r;
vector <OP> op;
};
queue <OP2> dl;
int m,q,ans[N];
int main()
{
freopen("2617.in","r",stdin);
freopen("2617.out","w",stdout);
int TIME=clock();
n=read(),m=read();
for(int i=1;i<=n;i++)
a[i]=read();
char type[5];
for(int i=1;i<=m;i++)
{
scanf("%s",type+1);
if(type[1]=='Q')
op[i].l=read(),op[i].r=read(),op[i].x=op[i].r-op[i].l+2-read(),op[i].no=++q;
else
op[i].l=read(),op[i].r=read();
}
OP2 now;
now.l=1,now.r=inf;
OP temp;
for(int i=1;i<=n;i++)
temp.l=i,temp.r=a[i],temp.no=0,
now.op.push_back(temp);
for(int i=1;i<=m;i++)
{
temp.no=-1,temp.l=op[i].l;
if(op[i].no==0)
now.op.push_back(temp);
now.op.push_back(op[i]);
}
dl.push(now);
while(dl.empty()==false)
{
now=dl.front();
dl.pop();
if(now.op.size()==0)
continue;
if(now.l==now.r)
{
for(int i=0;i<int(now.op.size());i++)
ans[now.op[i].no]=now.l;
continue;
}
int mid=(now.l+now.r)/2;
OP2 L,R;
for(int i=0;i<int(now.op.size());i++)
if(now.op[i].no==0)
{
bit.Add(now.op[i].l,now.op[i].r>mid);
if(now.op[i].r>mid)
R.op.push_back(now.op[i]);
else
L.op.push_back(now.op[i]);
}
else if(now.op[i].no==-1)
{
if(bit.Query(now.op[i].l,now.op[i].l)==1)
R.op.push_back(now.op[i]);
else
L.op.push_back(now.op[i]);
bit.Add(now.op[i].l,0);
}
else
{
int tmp=bit.Query(now.op[i].l,now.op[i].r);
if(tmp>=now.op[i].x)
R.op.push_back(now.op[i]);
else
{
now.op[i].x=now.op[i].x-tmp;
L.op.push_back(now.op[i]);
}
}
for(int i=now.op.size()-1;i>=0;i--)
if(now.op[i].no==0)
bit.Add(now.op[i].l,0);
L.l=now.l,L.r=mid;
R.l=mid+1,R.r=now.r;
dl.push(R);
dl.push(L);
}
for(int i=1;i<=q;i++)
printf("%d\n",ans[i]);
cerr<<clock()-TIME<<endl;
return 0;
}
|
