下面的代码是与左偏树完全相反的右偏树写法大误
其实左右互掉后没什么影响,就是把左当作右,把右当作左。(不就是一回事吗。。。。)
速度好像快一点?误。。
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
inline void read( int &res ){
static char ch;int flag=1;
while((ch=getchar())<'0'||ch>'9')if(ch=='-')flag=-1;res=ch-48;
while((ch=getchar())>='0'&&ch<='9')res=res*10+ch-48;res*=flag;
}
const int N = 1000005;
int n,m,sz[N],dead[N],l[N],r[N],fa[N],d[N];
int find(int x){
return x==fa[x]?x:fa[x]=find(fa[x]);
}
int merge(int x,int y){
if(x==0||y==0)return x+y;
if(sz[x]>sz[y])swap(x,y);
l[x]=merge(l[x],y);
if(d[r[x]]<d[l[x]])swap(l[x],r[x]);
d[x]=d[l[x]]+1;
return x;
}
int main(){
read(n);
for(register int i=1;i<= n;i++)fa[i]=i,read(sz[i]);
read(m);
d[0]=-1;
int x,y;
char s[15];
for(int i=1;i<=m;i++){
scanf("%s",s);
if(s[0]=='K'){
read(x);
if(dead[x]){
printf("0\n");
continue;
}
int tmp=find(x);
printf("%d\n",sz[tmp]);
dead[tmp]=1;
fa[tmp]=merge(l[tmp],r[tmp]);
fa[fa[tmp]]=fa[tmp];
}else{
read(x),read(y);
if(dead[x]||dead[y])continue;
int u=find(x),v=find(y);
if(u!=v)fa[u]=fa[v]=merge(u,v);
}
}
return 0;
}