bzoj1455罗马游戏

左偏树裸题。

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=1e6+5;
int n,m;
int fa[N],l[N],r[N],d[N],v[N];
bool die[N];
int find(int x)
{
    if (fa[x]==x)return x;
    else return fa[x]=find(fa[x]);
}
int merge(int x,int y)
{
    if (!x)return y;
    if (!y)return x;
    if (v[x]>v[y])swap(x,y);
    r[x]=merge(r[x],y);
    fa[r[x]]=x;
    if (d[r[x]]>d[l[x]])swap(l[x],r[x]);
    d[x]=d[r[x]]+1;
    return x;
}
int main()
{
    scanf("%d",&n);
    fo(i,1,n)scanf("%d",&v[i]);
    fo(i,1,n)fa[i]=i;
    d[0]=-1;
    char ch[10];
    scanf("%d",&m);
    fo(i,1,m)
    {
        scanf("%s",ch);
        if (ch[0]=='M')
        {
            int x,y;
            scanf("%d%d",&x,&y);
            if (die[x]||die[y])continue;
            int fx=find(x),fy=find(y);
            if (fx!=fy)
            {
                int t=merge(fx,fy);
                fa[fx]=fa[fy]=t;
            }
        }
        else 
        {
            int x;
            scanf("%d",&x);
            if (die[x])printf("0\n");
            else 
            {
                int fx=find(x);
                die[fx]=1;
                printf("%d\n",v[fx]);
                fa[fx]=merge(l[fx],r[fx]);
                fa[fa[fx]]=fa[fx];
            }
        }
    }
    return 0;
}