bzoj1455

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<cmath>
 5 #include<ctime>
 6 #include<cstdlib>
 7 #include<algorithm>
 8 #include<set>
 9 #define lowbit(a) ((a)&(-(a)))
10 #define clr(a,x) memset(a,x,sizeof(a))
11 #define rep(i,l,r) for(int i=l;i<(r);i++)
12 using namespace std;
13 typedef long long ll;
14 typedef pair<int,int> pii;
15 int read()
16 {
17     char c=getchar();
18     int ans=0,f=1;
19     while(!isdigit(c)){
20         if(c==‘-‘) f=-1;
21         c=getchar();
22     }
23     while(isdigit(c)){
24         ans=ans*10+c-‘0‘;
25         c=getchar();
26     }
27     return ans*f;
28 }
29 const int maxn=1000009;
30 int n,m,f[maxn];
31 set<pii>S[maxn];
32 bool p[maxn];
33 int find(int x){
34     return f[x]==x?f[x]:f[x]=find(f[x]);
35 }
36 int main()
37 {    
38     rep(i,1,maxn) f[i]=i;clr(p,1);
39     n=read();
40     rep(i,1,n+1){
41         int t=read();
42         S[i].insert(make_pair(t,i));
43     }
44     m=read();
45     while(m--){
46         char opt=getchar();
47         while(opt!=‘M‘&&opt!=‘K‘) opt=getchar();
48         if(opt==‘M‘){
49             int x=read(),y=read();
50             if(!p[x]||!p[y]) continue;
51             x=find(x);y=find(y);
52             if(x==y) continue;
53             if(S[x].size()>S[y].size()) swap(x,y);f[x]=y;
54             while(!S[x].empty()){
55                 pii o=*S[x].begin();S[x].erase(S[x].begin());
56                 S[y].insert(o);
57             }
58         }else{
59             int x=read();
60             if(!p[x]){
61                 puts("0");
62                 continue;
63             }
64             x=find(x);
65             pii o=*S[x].begin();S[x].erase(S[x].begin());
66             p[o.second]=0;
67             printf("%d\n",o.first);
68         }
69     }
70     return 0;
71 }