1198线段树解法求调

#include<bits/stdc++.h>  
#define lc m<<1
#define rc m<<1|1 
const int N=500005;
using namespace std;    
int n,m;
struct tree{
	int l,r,sum;
}tr[4*N];
void pushup(int u){
	tr[u].sum=max(tr[lc].sum,tr[rc].sum);
}
void build(int u,int l,int r){
	tr[u]={l,r};
	if(l==r)return ;
	int jjj=(l+r)>>1;
	build(lc,l,jjj);
	build(rc,jjj+1,r);
}
void change(int u,int x,int y){
	if(tr[u].l==x&&tr[u].r==x){
		tr[u].sum=y;
		return ;
	} 
	int jjj=(tr[u].l+tr[u].r)>>1;
	if(x<=jjj)change(lc,x,y);
	else change(rc,x,y);
	pushup(u);
}

int query(int u,int l,int r){
	if(l<=tr[u].l&&tr[u].r<=r)return tr[u].sum;
	int m=tr[u].l+tr[u].r>>1;
	int res=-2e9;
	if(l<=m)res=query(lc,l,r);
	if(r>m)res=max(res,query(rc,l,r));
}
int main(){
	ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    char a;
    int x=0,y=0,z=0;
    cin>>n>>m;
    build(1,1,m);
    for(int i=1;i<=n;i++){
    	cin>>a>>x;
    	if(a=='A')
    		change(1,y++,(x+z)%m);
    	else {
    		query(1,y-x+1,y);
    		cout<<z<<endl;
		}
	}
	return 0;
}