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
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
|
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
using namespace std;
const int maxn = 500010;
queue<int> Q;
int n, m, rt;
char buf[100];
int a[maxn];
int ch[maxn][2], fa[maxn], rev[maxn], has_tag[maxn], sz[maxn], tag[maxn], val[maxn], lsum[maxn], rsum[maxn], msum[maxn], sum[maxn], mx[maxn];
void (int x) {
sz[x] = sz[ch[x][0]] + sz[ch[x][1]] + 1;
sum[x] = sum[ch[x][0]] + sum[ch[x][1]] + val[x];
msum[x] = max(rsum[ch[x][0]] + lsum[ch[x][1]] + val[x], max(msum[ch[x][0]], msum[ch[x][1]]));
lsum[x] = max(lsum[ch[x][0]], sum[ch[x][0]] + val[x] + lsum[ch[x][1]]);
rsum[x] = max(rsum[ch[x][1]], sum[ch[x][1]] + val[x] + rsum[ch[x][0]]);
mx[x] = max(val[x], max(mx[ch[x][0]], mx[ch[x][1]]));
}
int newNode(int v) {
int ret = Q.front(); Q.pop();
rev[ret] = 0;
tag[ret] = has_tag[ret] = 0;
fa[ret] = 0;
ch[ret][0] = ch[ret][1] = 0;
sz[ret] = 1;
sum[ret] = val[ret] = v;
mx[ret] = v;
if (v > 0) lsum[ret] = rsum[ret] = msum[ret] = v;
else lsum[ret] = rsum[ret] = msum[ret] = 0;
return ret;
}
void Rev(int x) {
swap(ch[x][0], ch[x][1]);
rev[x] ^= 1;
swap(lsum[x], rsum[x]);
}
void modify(int x, int v) {
tag[x] = v; has_tag[x] = 1;
sum[x] = sz[x]*v;
val[x] = v;
mx[x] = v;
if (v > 0) lsum[x] = rsum[x] = msum[x] = sz[x]*v;
else lsum[x] = rsum[x] = msum[x] = 0;
}
void pushDown(int x) {
if (rev[x]) {
if (ch[x][0]) Rev(ch[x][0]);
if (ch[x][1]) Rev(ch[x][1]);
rev[x] = 0;
}
if (has_tag[x]) {
if (ch[x][0]) modify(ch[x][0], tag[x]);
if (ch[x][1]) modify(ch[x][1], tag[x]);
has_tag[x] = 0;
}
}
void delNode(int x) {
Q.push(x);
}
int getson(int x) {
return ch[fa[x]][1] == x;
}
void rotate(int x) {
if (!fa[x]) return;
int f = fa[x], ff = fa[fa[x]], s = getson(x);
if (ff) ch[ff][getson(f)] = x;
fa[x] = ff;
ch[f][s] = ch[x][s^1];
fa[ch[x][s^1]] = f;
ch[x][s^1] = f;
fa[f] = x;
pushUp(f); pushUp(x);
}
void PushDown(int x) {
if (fa[x]) PushDown(fa[x]);
pushDown(x);
}
void splay(int x) {
PushDown(x);
for (int f; fa[x]; rotate(x)) {
if (fa[f=fa[x]]) {
rotate((getson(f) == getson(x)) ? f : x);
}
}
rt = x;
}
int getRank(int x) {
splay(x);
return sz[ch[x][0]] + 1;
}
int kth(int x, int k) {
pushDown(x);
if (k <= sz[ch[x][0]]) {
return kth(ch[x][0], k);
} else if (k == sz[ch[x][0]] + 1) {
splay(x);
return x;
} else return kth(ch[x][1], k-1-sz[ch[x][0]]);
}
void split(int k, int r, int &r1, int &r2) {
if (!k) {
r1 = 0;
r2 = r;
return;
}
if (k == sz[r]) {
r1 = r;
r2 = 0;
return;
}
int x = kth(r, k);
int rs = ch[x][1];
fa[rs] = ch[x][1] = 0;
pushUp(x);
r1 = x; r2 = rs;
}
int maxNode(int x) {
while (ch[x][1]) {
pushDown(x);
x = ch[x][1];
}
splay(x);
return x;
}
int merge(int x, int y) {
if (!x || !y) return x+y;
splay(x);
int mx = maxNode(x);
ch[mx][1] = y; fa[y] = mx;
pushUp(mx);
return mx;
}
void del(int r) {
if (ch[r][0]) del(ch[r][0]);
delNode(r);
if (ch[r][1]) del(ch[r][1]);
}
void print(int r) {
pushDown(r);
if (ch[r][0]) print(ch[r][0]);
printf("%d ", val[r]);
if (ch[r][1]) print(ch[r][1]);
}
int main() {
mx[0] = -0x3f3f3f3f;
scanf("%d%d", &n, &m);
for (int i = 1; i <= 500000; i++) Q.push(i);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
newNode(a[i]);
}
for (int i = n; i > 1; i--) {
fa[i] = i-1;
ch[i-1][1] = i;
pushUp(i-1);
}
rt = 1;
for (int i = 1; i <= m; i++) {
scanf("%s", buf);
if (buf[0] == 'I') {
int p, cnt;
scanf("%d%d", &p, &cnt);
int t_rt = 0;
while (cnt --) {
int c; scanf("%d", &c);
int t = newNode(c);
ch[t][0] = t_rt;
if (t_rt) fa[t_rt] = t;
t_rt = t;
pushUp(t);
}
int r1, r2;
split(p, rt, r1, r2);
rt = merge(merge(r1, t_rt), r2);
} else if (buf[0] == 'D') {
int p, cnt;
scanf("%d%d", &p, &cnt);
int r1, r2, r3;
split(p-1, rt, r1, r2);
split(cnt, r2, r2, r3);
rt = merge(r1, r3);
del(r2);
} else if (buf[0] == 'M') {
if (buf[2] == 'K') {
int p, cnt, v;
scanf("%d%d%d", &p, &cnt, &v);
int r1, r2, r3;
split(p-1, rt, r1, r2);
split(cnt, r2, r2, r3);
if (r2) modify(r2, v);
rt = merge(merge(r1, r2), r3);
} else {
if (mx[rt] < 0) printf("%dn", mx[rt]);
else printf("%dn", msum[rt]);
}
} else if (buf[0] == 'R') {
int p, cnt;
scanf("%d%d", &p, &cnt);
int r1, r2, r3;
split(p-1, rt, r1, r2);
split(cnt, r2, r2, r3);
Rev(r2);
rt = merge(merge(r1, r2), r3);
} else {
int p, cnt;
scanf("%d%d", &p, &cnt);
if (!cnt) {
puts("0");
} else {
int r1, r2, r3;
split(p-1, rt, r1, r2);
split(cnt, r2, r2, r3);
printf("%dn", sum[r2]);
rt = merge(merge(r1, r2), r3);
}
}
}
return 0;
}
|
近期评论