用的是 $lazytag$，但也不知道哪里写锅了，调了 $1h$ 了 T_T

#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN=600010;
int n,m,a[MAXN],tree[MAXN],tag[MAXN];
inline int read()
{
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9')s=s*10+(ch-'0'),ch=getchar();
	return s*w;
}
inline int lc(int p){return p<<1;}
inline int rc(int p){return p<<1|1;}
void lazy_tag(int u,int l,int r,int k)
{
	tag[u]+=k;
	tree[u]+=k*(l+r-1);
}
void push_up(int u)
{
	tree[u]=max(tree[lc(u)],tree[rc(u)]);
}
void push_down(int u,int l,int r)
{
	int mid=(l+r)>>1;
	lazy_tag(lc(u),l,mid,tag[u]);
	lazy_tag(rc(u),mid+1,r,tag[u]);
	tag[u]=0;
}
void build(int u,int l,int r)
{
	if(l==r)
	{
		tree[u]=a[l];
		return;
	}
	int mid=(l+r)>>1;
	build(lc(u),l,mid);
	build(rc(u),mid+1,r);
	push_up(u);
}
void update(int u,int l,int r,int ln,int rn,int k)
{
	if(ln<=l&&r<=rn)
	{
		lazy_tag(u,l,r,k);
		return;
	}
	push_down(u,l,r);
	int mid=(l+r)>>1;
	if(ln<=mid) update(lc(u),l,mid,ln,rn,k);
	if(rn>mid) update(rc(u),mid+1,r,ln,rn,k);
	push_up(u);
}
int query(int u,int l,int r,int ln,int rn)
{
	int t=0;
	if(ln<=l&&r<=rn) return max(t,tree[u]);
	int mid=(l+r)>>1;
	push_down(u,l,r);
	if(ln<=mid) t=max(t,query(lc(u),l,mid,ln,rn));
	if(rn>mid) t=max(t,query(rc(u),mid+1,r,ln,rn));
	return t;
}
int main()
{
	n=read(),m=read();
	for(register int i=1;i<=n;i++) a[i]=read();
	build(1,1,n);
	while(m--)
	{
		for(register int i=1;i<=n;i++)
		{
			printf("%d ",query(1,1,n,i,i));
		}
		printf("\n"); 
		char opt[5];
		scanf("%s",opt);
		if(opt[0]=='Q')
		{
			int x=read(),y=read();
			printf("ans:%d\n",query(1,1,n,x,y));
		}
		else
		{
			int x=read(),B=read();
			int A=query(1,1,n,x,x);
			if(A<B) update(1,1,n,x,x,B);
			A=query(1,1,n,x,x);
			printf("A:%d\n",A);
			
		}
	}
}