Tyvj 1607 小熊的早餐

0

100

99

const MaxN=100010;
 type
 tre=record
 l,r,lc,rc,max:longint;
 end;//tre
var
 tree:array[0..MaxN*4] of tre;
 n,m,i,j,x,a,b,root,tot,ans,p:longint;
 ch:char;
 s:string;
procedure build(var t:longint;l,r:longint);
begin
 inc(tot);t:=tot;
 tree[t].l:=l;tree[t].r:=r;
 tree[t].max:=0;
 ifl<r then
 begin
  build(tree[t].lc,l,(l+r)div 2);
  build(tree[t].rc,(l+r)div 2+1,r);
 end;//if
end;
function max(a,b:longint):longint;
begin
 ifa<b then exit(b);
 exit(a);
end;
procedure insert(t,i:longint);
begin
 ift=0 then exit;
 iftree[t].l=tree[t].r then
 begin
  tree[t].max:=x;
  exit;
 end;
 iftree[tree[t].lc].r>=i then insert(tree[t].lc,i)
 else insert(tree[t].rc,i);
 tree[t].max:=max(tree[tree[t].lc].max,tree[tree[t].rc].max);｛<边插入边维护>｝
end;
begin
 readln(n,m);
 root:=0;tot:=0;
 build(root,1,n);
 fori:=1 to m do
 begin
  read(ch);
  case ch of
   'Y':begin
        writeln(tree[root].max);
        readln(s);
       end;
   'L':begin
        while ch<>' ' do read(ch);
        readln(a,x);
        insert(root,a);
       end;
   'U':begin｛<不喜欢就是插入-maxlongint>｝
        while ch<>' ' do read(ch);
        readln(a);
        x:=-maxlongint;
        insert(root,a);
       end;
   end;
 end;
end.