bzoj1455

学习了一下可合并堆的一种写法——左偏树
感觉左偏树是一种类似启发式的方法
学习左偏树后这题就水过去了

var fa,l,r,a,d:array[0..1000010] of longint;
    v:array[0..1000010] of boolean;
    i,n,m,x,y,f:longint;
    ch:char;

function getf(x:longint):longint;
  begin
    if fa[x]<>x then fa[x]:=getf(fa[x]);
    exit(fa[x]);
  end;

procedure swap(var a,b:longint);
  var c:longint;
  begin
    c:=a;
    a:=b;
    b:=c;
  end;

function merge(x,y:longint):longint;
  begin
    if x=0 then exit(y);
    if y=0 then exit(x);
    if a[x]>a[y] then swap(x,y);
    r[x]:=merge(r[x],y);
    if d[r[x]]>d[l[x]] then swap(l[x],r[x]);
    d[x]:=d[r[x]]+1;  //d表示这个节点到最近的可插入节点的距离，根据左偏树性质易得
    exit(x);
  end;

begin
  readln(n);
  for i:=1 to n do
  begin
    read(a[i]);
    fa[i]:=i;
  end;
  d[0]:=-1;
  readln(m);
  for i:=1 to m do
  begin
    read(ch);
    if ch='M' then
    begin
      readln(x,y);
      if v[x] or v[y] then continue;
      x:=getf(x);
      y:=getf(y);
      if x=y then continue;
      f:=merge(x,y);
      fa[x]:=f;
      fa[y]:=f;
    end
    else begin
      readln(x);
      if v[x] then
      begin
        writeln(0);
        continue;
      end;
      x:=getf(x);
      v[x]:=true;
      writeln(a[x]);
      fa[x]:=merge(l[x],r[x]);
      fa[fa[x]]:=fa[x];
    end;
  end;
end.