线段树裸题......
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#define lch a[n].lc
#define rch a[n].rc
using namespace std;
const int maxn=1000010;
int n,m,root;
long long mo,t,xx,tail,topt;
char c;
struct data
{
int l,r,lc,rc;
long long ma;
}a[maxn];
void updata(int n)
{a[n].ma=max(a[lch].ma,a[rch].ma);}
void build_tree(int &n,int l,int r)
{
n=++topt; a[n].l=l; a[n].r=r;
if (l==r) return;
int mid=(l+r)>>1;
build_tree(lch,l,mid);
build_tree(rch,mid+1,r);
}
void add_tree(int n,int L,int R,int lc,long long x)
{
if (L==R && R==lc) {a[n].ma=x; return;}
if (L==R) return;
int mid=(L+R)>>1;
if (lc<=mid) add_tree(lch,L,mid,lc,x);
else add_tree(rch,mid+1,R,lc,x);
updata(n);
}
long long qury(int n,int L,int R,int l,int r)
{
if (L==l && R==r) {return a[n].ma;}
int mid=(L+R)>>1;
if (r<=mid) return qury(lch,L,mid,l,r);
else if (l>=mid+1) return qury(rch,mid+1,R,l,r);
else return max(qury(lch,L,mid,l,mid),qury(rch,mid+1,R,mid+1,r));
}
int main()
{
scanf("%d%lld%c",&m,&mo,&c); n=m; root=1;
build_tree(root,1,n);
while (m--)
{
scanf("%c%lld",&c,&xx);
if (c=='Q')
{
t=qury(root,1,n,tail-xx+1,tail);
printf("%lld\n",t);
}
else
{
tail++;
add_tree(root,1,n,tail,(xx+t)%mo);
}
scanf("%c",&c);
}
return 0;
}