BZOJ3224:普通平衡树(含SBT、Treap、Splay模板)
传送门
这道题就是裸的平衡树的题目，操作都是模板，也就不多说了，重在代码。
SBT:
#include1],x);
} else pred(t[k].ch[0],x);
}
void succ(int k,int x) {
if(k==0)return;
if(t[k].v>x) {
ans=k;
succ(t[k].ch[0],x);
} else succ(t[k].ch[1],x);
}
char c, f;
inline void GET(int &n) {
n = 0; f = 1;
do {c = getchar(); if(c == '-') f = -1;} while(c > '9' || c < '0');
while(c >= '0' && c <= '9') {n=n*10+c-'0';c=getchar();}
n *= f;
}
int main() {
GET(n);
int opt,x;
for(int i=1; i<=n; i++) {
GET(opt); GET(x);
switch(opt) {
case 1: Ins(root,x); break;
case 2: Del(root,x); break;
case 3: printf("%d\n",Ran(root,x)); break;
case 4: printf("%d\n",Kth(root,x)); break;
case 5: ans=0; pred(root,x); printf("%d\n",t[ans].v); break;
case 6: ans=0; succ(root,x); printf("%d\n",t[ans].v); break;
}
}
return 0;
}
Treap:
#includevoid del(int &k,int x) {
if(k==0)return;
if(tr[k].v==x) {
if(tr[k].cnt>1) { tr[k].cnt--; tr[k].sz--; return; }
if(tr[k].ch[0]*tr[k].ch[1]==0)k=tr[k].ch[0]+tr[k].ch[1];
else rot(k, tr[tr[k].ch[0]].rnd >= tr[tr[k].ch[1]].rnd), del(k, x);
} else tr[k].sz--, del(tr[k].ch[x>tr[k].v], x);
}
int get_rank(int k,int x) {
if(k==0)return 0;
if(tr[k].v==x)return tr[tr[k].ch[0]].sz+1;
else if(x>tr[k].v)
return tr[tr[k].ch[0]].sz+tr[k].cnt+get_rank(tr[k].ch[1],x);
else return get_rank(tr[k].ch[0],x);
}
int get_kth(int k,int x) {
if(k==0)return 0;
if(x<=tr[tr[k].ch[0]].sz)
return get_kth(tr[k].ch[0],x);
else if(x>tr[tr[k].ch[0]].sz+tr[k].cnt)
return get_kth(tr[k].ch[1],x-tr[tr[k].ch[0]].sz-tr[k].cnt);
else return tr[k].v;
}
void pred(int k,int x) {
if(k==0)return;
if(tr[k].v1],x);
} else pred(tr[k].ch[0],x);
}
void succ(int k,int x) {
if(k==0)return;
if(tr[k].v>x) {
ans=k;
succ(tr[k].ch[0],x);
} else succ(tr[k].ch[1],x);
}char c, f;
inline void GET(int &n) {
n = 0; f = 1;
do {c = getchar(); if(c == '-') f = -1;} while(c > '9' || c < '0');
while(c >= '0' && c <= '9') {n=n*10+c-'0';c=getchar();}
n *= f;
}
int main() {
GET(n);
int opt,x;
for(int i=1; i<=n; i++) {
GET(opt); GET(x);
switch(opt) {
case 1: insert(root,x); break;
case 2: del(root,x); break;
case 3: printf("%d\n",get_rank(root,x)); break;
case 4: printf("%d\n",get_kth(root,x)); break;
case 5: ans=0; pred(root,x); printf("%d\n",tr[ans].v); break;
case 6: ans=0; succ(root,x); printf("%d\n",tr[ans].v); break;
}
}
return 0;
}
Splay
#include1];
}
else if(t[p].sz>=x) y=p;
else return t[y].v;
}
}
int Nxt(int x, bool f)
{
Find(x);
if((t[rt].v>x&&f)||(t[rt].vreturn rt;
int p = t[rt].ch[f];
while(t[p].ch[f^1]) p = t[p].ch[!f];
return p;
}
void Del(int v) {
int p = Nxt(v, 0), s = Nxt(v, 1);
Spaly(p, 0); Spaly(s, p);
p = t[s].ch[0];
if(t[p].cnt > 1) -- t[p].cnt, Spaly(p, 0);
else t[s].ch[0] = 0;
}
char c, f;
inline void GET(int &n) {
n = 0; f = 1;
do {c = getchar(); if(c == '-') f = -1;} while(c > '9' || c < '0');
while(c >= '0' && c <= '9') {n=n*10+c-'0';c=getchar();}
n *= f;
}
int main() {
GET(n);
int opt,x;
Ins(rt, -0x7fffffff); Ins(rt, +0x7fffffff);
for(int i=1; i<=n; i++) {
GET(opt); GET(x);
switch(opt) {
case 1: Ins(rt,x); break;
case 2: Del(x); break;
case 3: printf("%d\n",Ran(x)); break;
case 4: printf("%d\n",Kth(x+1)); break;
case 5: printf("%d\n",t[Nxt(x, 0)].v); break;
case 6: printf("%d\n",t[Nxt(x, 1)].v); break;
}
}
return 0;
}