JSOI最大值 （线段树）

change 单点修改

query 区间最值

Program XJOI2321;
const maxn=200008;
var l,r,max:array[0..maxn*4] 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*2],max[x*2+1]);
end;
procedure build(x,lt,rt:longint);
var mid:longint;
begin
    l[x]:=lt;
    r[x]:=rt;
    if lt=rt then
    begin
        max[i]:=0;
        exit;
    end;
    mid:=(lt+rt) div 2;
    build(x*2,lt,mid);
    build(x*2+1,mid+1,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 2;
    if G<=mid then change(x*2,G,val) else change(x*2+1,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 2;
    as:=0;
    if lt<=mid then as:=mx(as,query(x*2,lt,rt));
    if mid<rt  then as:=mx(as,query(x*2+1,lt,rt));
    exit(as);
end;
begin
    readln(m,p);
    ans:=0; n:=0;
    build(1,1,m);
    for i:=1 to m do
    begin
        readln(ch,x);
        if ch='A' then
        begin
            x:=(x+ans) mod p;
            inc(n);
            change(1,n,x);
        end else
        begin
            ans:=query(1,n-x+1,n);
            writeln(ans);
        end;
    
    end;

end.