JSOI最大值 （线段树）

change 单点修改

query 区间最值

 Program XJOI2321;
 const maxn=;
 var l,r,max:array[..maxn*] of longint;
     i,m,n,ans,p,x:longint;
     ch:char;
 function mx(a,b:longint):longint;
 begin
     if a>b then exit(a) else exit(b);
 end;
 procedure up(x:longint);
 begin
     max[x]:=mx(max[x*],max[x*+]);
 end;
 procedure build(x,lt,rt:longint);
 var mid:longint;
 begin
     l[x]:=lt;
     r[x]:=rt;
     if lt=rt then
     begin
         max[i]:=;
         exit;
     end;
     mid:=(lt+rt) div ;
     build(x*,lt,mid);
     build(x*+,mid+,rt);
     up(x);
 end;
 procedure change(x,G,val:longint);
 var mid:longint;
 begin
     if l[x]=r[x] then
     begin
         max[x]:=val;
         exit;
     end;
     mid:=(l[x]+r[x]) div ;
     if G<=mid then change(x*,G,val) else change(x*+,G,val);
     up(x);
 end;
 function query(x,lt,rt:longint):longint;
 var mid,as:longint;
 begin
     if (lt<=l[x]) and (r[x]<=rt) then exit(max[x]);
     mid:=(l[x]+r[x]) div ;
     as:=;
     if lt<=mid then as:=mx(as,query(x*,lt,rt));
     if mid<rt  then as:=mx(as,query(x*+,lt,rt));
     exit(as);
 end;
 begin
     readln(m,p);
     ans:=; n:=;
     build(,,m);
     for i:= to m do
     begin
         readln(ch,x);
         if ch='A' then
         begin
             x:=(x+ans) mod p;
             inc(n);
             change(,n,x);
         end else
         begin
             ans:=query(,n-x+,n);
             writeln(ans);
         end;

     end;

 end.