萌新求教...得了20分...其它点全T了...QAQ

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
const int MAXN=200001;
ll ans[4*MAXN],a[MAXN];
int n=0,m;
ll mod,result;
void build(int l,int r,int p)
{
	int mid;
	if(l==r)
	{
		ans[p]=a[l];
		return;
	}
	mid=(l+r)>>1;
	build(l,mid,p<<1);
	build(mid+1,r,p<<1|1);
	ans[p]=max(ans[p<<1],ans[p<<1|1]);
}
ll query(int x,int y,int l,int r,int p)
{
	int mid;
	ll res=-99999999;
	if(x>r||y<l)
		return -99999999;
	if(x<=l&&y>=r)
		return ans[p];
	mid=(l+r)>>1;
	if(x<=mid)
		res=max(res,query(x,y,l,mid,p<<1));
	if(y>mid)
		res=max(res,query(x,y,mid+1,r,p<<1|1));
	return res;
}
int main()
{
	freopen("text.in","r",stdin);
	freopen("text.out","w",stdout);
	scanf("%d %lld\n",&m,&mod);
	for(int i=1;i<=m;i++)
	{
		char ch;
		int l;
		scanf("%c ",&ch);
		if(ch=='A')
		{
			n++;
			scanf("%lld\n",&a[n]);
			a[n]=(a[n]+result)%mod;
			build(1,n,1);
		}
		if(ch=='Q')
		{
			scanf("%d\n",&l);
			if(n==0)
			{
				printf("0\n");
				continue;
			}
			result=query(n-l+1,n,1,n,1);
			printf("%lld\n",result);
		}
	}
	return 0;
 } ```