洛谷P1046 陶陶摘苹果

我们将所有苹果高度插入一个splay中

我们要找到不高于陶陶手的苹果数量，就插入一个陶陶的高度 + 1的节点作为 哨兵 ，将其splay到根，那么它左子树的大小就是所求

贴一个优美而不失简洁的splay

#include<bits/stdc++.h>
#define ls ch[u][0]
#define rs ch[u][1]
#define isr(u) (ch[fa[u]][1] == u)
const int maxn = 15;
inline int read(){
	int out = 0,flag = 1; char c = getchar();
	while(c < 48 || c > 57){
		if(c == '-'){
			flag = -1;
			c = getchar();
		} 
	}
	while(c >= 48 && c <= 57){
		out = (out << 3) + (out << 1) + c - 48;
		c = getchar();
	}
	return out * flag;
}
int ch[maxn][2],fa[maxn],siz[maxn],val[maxn],cnt[maxn],n,Siz,rt;
void pup(int u){
	siz[u] = siz[ls] + cnt[u] + siz[rs];
}
void spin(int u){
	int s = isr(u),f = fa[u];
	fa[u] = fa[f];
	if(fa[f]){
		ch[fa[f]][isr(f)] = u;
	}
	ch[f][s] = ch[u][s ^ 1];
	if(ch[u][s ^ 1]){
		fa[ch[u][s ^ 1]] = f;
	}
	fa[f] = u;
	ch[u][s ^ 1] = f;
	pup(f);
	pup(u);
}
void splay(int u){
	for(;fa[u];spin(u))
		if(fa[fa[u]]){
			spin((isr(fa[u]) ^ isr(u)) ? u : fa[u]);
		}
	rt = u;
}
void ins(int &u,int v,int f){
	if(!u){
		val[u = ++Siz] = v;
		cnt[u] = siz[u] = 1;
		fa[u] = f;
		splay(u);
	}
	else if(val[u] > v){
		ins(ls,v,u);
	}
	else if(val[u] < v){
		ins(rs,v,u);
	}
	else{
		cnt[u]++;
		siz[u]++;
		splay(u);
	}
}
int main(){
	for(int i = 1;i <= 10;i++){
		ins(rt,read(),0);
	}
	ins(rt,read() + 31,0);
	printf("%d\n",siz[ch[rt][0]]);
	return 0;
}