bzoj1861 book书架 splay

       splay裸题，快速分裂和合并就好了。

AC代码如下（自带大常数T_T）：

#include<iostream>
#include<cstdio>
#include<cstring>
#define N 100005
using namespace std;

int n,m,rt,c[N][2],sz[N],pos[N],a[N],fa[N];
int read(){
	int x=0,fu=1; char ch=getchar();
	while (ch<'0' || ch>'9'){ if (ch=='-') fu=-1; ch=getchar(); }
	while (ch>='0' && ch<='9'){ x=x*10+ch-'0'; ch=getchar(); }
	return x*fu;
}
void maintain(int k){
	sz[k]=sz[c[k][0]]+sz[c[k][1]]+1;
}
void rotate(int x,int &k){
	int y=fa[x],z=fa[y],l=(c[y][0]==x)?0:1,r=l^1;
	if (y==k) k=x; else
		if (c[z][0]==y) c[z][0]=x; else c[z][1]=x;
	fa[x]=z; fa[y]=x; fa[c[x][r]]=y;
	c[y][l]=c[x][r]; c[x][r]=y;
	maintain(y); maintain(x);
}
void splay(int x,int &k){
	int y,z;
	while (x!=k){
		y=fa[x]; z=fa[y];
		if (y!=k){
			if (c[y][0]==x ^ c[z][0]==y) rotate(x,k);
				else rotate(y,k);
		}
		rotate(x,k);
	}
}
int find(int k,int rst){
	int l=c[k][0],r=c[k][1];
	if (sz[l]+1==rst) return k;
	else if (sz[l]>=rst) return find(l,rst);
		else return find(r,rst-sz[l]-1);
}
int getrnk(int k){
	k=pos[k]; splay(k,rt); return sz[c[k][0]]+1;
}
void del(int k){
	int x=find(rt,k-1),y=find(rt,k+1);
	splay(x,rt); splay(y,c[x][1]); k=c[y][0];
	fa[k]=sz[k]=c[y][0]=0;
	maintain(y); maintain(x);
}
void link(int k,int x,int y){
	splay(x,rt); splay(y,c[x][1]);
	fa[k]=y; sz[k]=1; c[y][0]=k;
	maintain(y); maintain(x);
}
void build(int &k,int l,int r){
	if (l>r){ k=0; return; }
	if (l==r){ k=l; sz[k]=1; return; }
	k=(l+r)>>1;
	build(c[k][0],l,k-1); build(c[k][1],k+1,r);
	if (c[k][0]) fa[c[k][0]]=k;
	if (c[k][1]) fa[c[k][1]]=k; maintain(k);
}
int main(){
	n=read(); m=read(); int i,x,y,z;
	for (i=2; i<=n+1; i++) pos[a[i]=read()]=i;
	build(rt,1,n+2); char ch;
	while (m--){
		ch=getchar(); while (ch<'A' || ch>'Z') ch=getchar();
		x=read();
		if (ch=='T'){
			del(getrnk(x)); link(pos[x],find(rt,1),find(rt,2));
		} else if (ch=='B'){
			del(getrnk(x));link(pos[x],find(rt,n),find(rt,n+1));
		} else if (ch=='I'){
			y=read(); del(z=getrnk(x));
			link(pos[x],find(rt,z+y-1),find(rt,z+y));
		} else if (ch=='A') printf("%d\n",getrnk(x)-2); 
		else printf("%d\n",a[find(rt,x+1)]);
	}
	return 0;
}

by lych

2016.2.28