这是一道权限题,感谢@wnjxyk 的帮忙

可并堆练习题..

这题没啥好说的...

代码:

#include<set>
#include<map>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<time.h>
#include<math.h>
#include<memory>
#include<vector>
#include<bitset>
#include<fstream>
#include<stdio.h>
#include<utility>
#include<sstream>
#include<string.h>
#include<iostream>
#include<stdlib.h>
#include<algorithm>
using namespace std;
struct node
{
    int val;
    int id;
    node * right;
    node * ch;
};
node * null;
node * a[1000005];
node * new_node(int x,int y)
{
    static node a[1000005];
    static int top=0;
    node * t=&a[top++];
    t->val=x;
    t->id=y;
    t->right=null;
    t->ch=null;
    return t;
}
node * join(node * x,node * y)
{
    if (x->val<y->val) swap(x,y);
    x->right=y->ch;
    y->ch=x;
    return y;
}
node * u(node * x)
{
    if (x==null) return x;
    node * y=x->right;
    if (y==null) return x;
    x->right=null;
    node * z=y->right;
    if (z==null) return join(x,y);
    y->right=null;
    return join(u(z),join(x,y));
}
int father[1000005];
int death[1000005];
int findroot(int x)
{
    int root;
    for (root=x;father[root]!=-1;root=father[root]) ;
    int temp;
    for (;father[x]!=-1;)
    {
        temp=father[x];
        father[x]=root;
        x=temp;
    }
    return root;
}
int main()
{
    #ifdef absi2011
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    null=new_node(1000000,-1);
    null->right=null;
    null->ch=null;
    int n;
    scanf("%d",&n);
    int i;
    for (i=0;i<n;i++)
    {
        father[i]=-1;
        int x;
        scanf("%d",&x);
        a[i]=new_node(x,i);
    }
    int m;
    scanf("%d",&m);
    for (i=0;i<m;i++)
    {
        static char c[5];
        scanf("%s",c);
        if (c[0]=='K')
        {
            int x;
            scanf("%d",&x);
            x--;
            if (death[x])
            {
                puts("0");
                continue;
            }
            x=findroot(x);
            printf("%d\n",a[x]->val);
            death[a[x]->id]=true;
            a[x]=u(a[x]->ch);
        }
        else
        {
            int x,y;
            scanf("%d%d",&x,&y);
            x--;
            y--;
            if (death[x]) continue;
            if (death[y]) continue;
            x=findroot(x);
            y=findroot(y);
            if (x==y) continue;
            a[x]=join(a[x],a[y]);
            father[y]=x;
        }
    }
    return 0;
}