终于AC力

#include<cstdio>
#include<queue>
#include<iostream>
#include<cmath>
#define LL long long 
#define For(i,N) for(int i=1;i<=N;i++)
 
const LL mod =100003;
using namespace std;
 
LL N,M,T,D;
const int maxn=2000000+1000;
LL W[maxn<<2]={0};
 
void pushup(int x)
{
	int l=x<<1,r=x<<1|1;
	W[x]=max(W[x],W[l]);
	W[x]=max(W[x],W[r]);
}
 
void build(int L,int R,int x)
{
	if(L==R)
	{
		W[x]=0;
		return ;
	}
	int mid=(L+R)>>1;
	build(L,mid,x<<1);
	build(mid+1,R,x<<1|1);
	pushup(x);
}
 
void update(int f,LL w,int x,int L,int R)
{
	if(L==R&&L==f)
	{
		W[x]=w;
		return ;
	}
	int mid=(L+R)>>1;
	if(f<=mid)
		update(f,w,x<<1,L,mid);
	else 
		update(f,w,x<<1|1,mid+1,R);
	pushup(x);
}
 
LL quary(int L,int R,int l,int r,LL x)
{
	if(R<l||L>r)return 0;
	if(l<=L&&r>=R)
	{
		return W[x];
	}
	int mid=(L+R)>>1;
	LL a=quary(L,mid,l,r,x<<1);
	LL b=quary(mid+1,R,l,r,x<<1|1);
	return max(a,b);
}
 
int main()
{
	//freopen("werw.txt","w",stdout);
	scanf("%lld%lld",&M,&D);
	N=M+1;
	LL n=0,t=0;
	build(1,N,1);
	char S[10];
	For(i,M)
	{
		LL x;
		scanf("%s",S);
		if(S[0]=='A')
		{
			scanf("%lld",&x);
			update(++n,(x+t)%D,1,1,N);
		}
		else 
		{
			scanf("%lld",&x);
			LL r=n;
			LL l=n-x+1;
			LL ans=quary(1,N,l,r,1);
			t=ans;
			printf("%lld\n",ans);
		}	
	}
	
	return 0;
}