学习新姿势
教程
数组版本的splay
伸展树的基本操作与应用
NOI题解
hdu splay模板题
spaly(x)指的是将x节点旋转到根节点。
修复序列
ac code
a[1] = a[n+2] 初始化为-inf
splay对区间操作模板(线段树建树)
|
|
splay模板2
|
|
splay学习
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
using namespace std;
typedef long long ll;
typedef vector <int> vi;
typedef set <int> si;
typedef pair <int, int> pii;
typedef long double ld;
const int MOD = 1e9 + 7;
const int maxn = 2e3+10;
const int maxm = 300009;
const int INF = 1e7;
int a[maxn];
int n, m;
namespace SplayTree
{
struct node {
int size, sum, mx, lm, rm, v;
int tag, rev;
int f, ch[2];
node() {}
node(int val) {ch[0] = ch[1] = tag = rev = f = 0; size = 1; v = sum = mx = lm = rm = val;}
}t[maxn*4];
int st[maxn], sz, top, root;
int newnode() {return top ? st[top--] : ++sz;}
int wh(int p) {return t[t[p].f].ch[1] == p;}
void init(){
sz = top = root = 0;
}
void rever(int p)
{
if(t[p].tag) return;
t[p].rev ^= 1;
swap(ls(p), rs(p)); swap(t[p].lm, t[p].rm);
}
void paint(int p, int val)
{
t[p].tag = 1; t[p].v = val;
t[p].sum = val * t[p].size;
t[p].lm = t[p].rm = t[p].mx = max(val, t[p].sum);
t[p].rev = 0;
}
void pushdown(int p)
{
if(t[p].rev)
{
if(ls(p)) rever(ls(p));
if(rs(p)) rever(rs(p));
t[p].rev = 0;
}
if(t[p].tag)
{
if(ls(p)) paint(ls(p), t[p].v);
if(rs(p)) paint(rs(p), t[p].v);
t[p].tag = 0;
}
}
void pushup(int p)
{
t[p].size = t[ls(p)].size + t[rs(p)].size + 1;
t[p].sum = t[ls(p)].sum + t[rs(p)].sum + t[p].v;
t[p].mx = max(max(t[ls(p)].mx, t[rs(p)].mx), max(0, t[ls(p)].rm) + t[p].v + max(0, t[rs(p)].lm));
t[p].lm = max(t[ls(p)].lm, t[ls(p)].sum + t[p].v + max(0, t[rs(p)].lm));
t[p].rm = max(t[rs(p)].rm, t[rs(p)].sum + t[p].v + max(0, t[ls(p)].rm));
}
void rotate(int p)
{
int f = t[p].f, g = t[f].f, c = wh(p);
if(g) t[g].ch[wh(f)] = p; t[p].f = g;
t[f].ch[c] = t[p].ch[c ^ 1]; if(t[f].ch[c]) t[t[f].ch[c]].f = f;
t[p].ch[c ^ 1] = f; t[f].f = p;
pushup(f); pushup(p);
}
void Splay(int p, int cur)
{
for(;t[p].f != cur; rotate(p))
if(t[t[p].f].f != cur) rotate(wh(p) == wh(t[p].f) ? t[p].f : p);
if(cur == 0) root = p;
}
void build_tree(int &p, int L, int R, int fa)
{
int mid = midf(L, R);
p = newnode();
t[p] = node(a[mid]);
t[p].f = fa;
if(L == R) return;
if(L < mid) build_tree(ls(p), L, mid - 1, p);
if(mid < R) build_tree(rs(p), mid + 1, R, p);
pushup(p);
}
int Kth(int k)
{
int p = root, lsize = 0;
while(p)
{
pushdown(p);
int cur = lsize + t[ls(p)].size;
if(k == cur + 1) return p;
if(k <= cur) p = ls(p);
else {
lsize = cur + 1;
p = rs(p);
}
}
return -1;
}
void Ins_from_a(int k, int tot)
{
for(int i = 1;i <= tot; ++i) scanf("%d", &a[i]);
int f = Kth(k + 1); Splay(f, 0);
int p = Kth(k + 2); Splay(p, f);
build_tree(ls(p), 1, tot, p);
pushup(p); pushup(f);
}
void erase(int p)
{
if(! p) return;
st[++ top] = p;
erase(ls(p)); erase(rs(p));
}
void Del(int k, int tot)
{
int f = Kth(k); Splay(f, 0);
int p = Kth(k + tot + 1); Splay(p, f);
erase(ls(p)); ls(p) = 0;
pushup(p); pushup(f);
}
void Mak(int k, int tot, int x)
{
int f = Kth(k); Splay(f, 0);
int p = Kth(k + tot + 1); Splay(p, f);
paint(ls(p), x);
pushup(p); pushup(f);
}
void Rev(int k, int tot)
{
int f = Kth(k); Splay(f, 0);
int p = Kth(k + tot + 1); Splay(p, f);
rever(ls(p));
pushup(p); pushup(f);
}
int Sum(int k, int tot)
{
int f = Kth(k); Splay(f, 0);
int p = Kth(k + tot + 1); Splay(p, f);
return t[ls(p)].sum;
}
int MaxSum(int k, int tot)
{
int f = Kth(k); Splay(f, 0);
int p = Kth(k + tot + 1); Splay(p, f);
return t[ls(p)].mx;
}
};
using namespace SplayTree;
int main()
{
char op[10];
while(scanf("%d%d", &n, &m) == 2)
{
init();
a[1] = -INF, a[n+2] = -INF;
t[0] = node(-INF), t[0].sum = t[0].size = 0;
inc(i, 2, n+1) scanf("%d", &a[i]);
build_tree(root, 1, n+2, 0);
int num = n;
int a, b, c;
for(int i=0; i<m; i++){
scanf("%s", op);
if(op[0] == 'G' &&op[4] == 'S'){
scanf("%d%d", &a, &b);
printf("%d\n", Sum(a, b));
}
else if(op[0] == 'M'&& op[4] == 'S'){
printf("%d\n", t[root].mx);
}
else if(op[0] == 'I'){
scanf("%d%d", &a, &b);
num += b;
Ins_from_a(a, b);
}
else if(op[0] == 'D'){
scanf("%d%d", &a, &b);
num -= 1;
Del(a, b);
}
else if(op[0] == 'M'&&op[5] == 'S'){
scanf("%d%d%d", &a, &b, &c);
Mak(a, b, c);
}
else if(op[0] == 'R'){
scanf("%d%d", &a, &b);
Rev(a, b);
}
}
}
return 0;
}
本文标题:splay学习
文章作者:Babydragon
发布时间:2018-07-27, 20:47:56
最后更新:2018-07-31, 10:32:09
原始链接:http://baolintian.github.io/2018/07/27/splay学习/
许可协议: "署名-非商用-相同方式共享 4.0" 转载请保留原文链接及作者。