I Hate It HDU 1754

#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;

const int MAXN=201000;

int t[MAXN<<2];

int n,m;

void pushup(int rt)
{
	t[rt]=max(t[rt<<1],t[rt<<1|1]);
}

void build(int l,int r,int rt)
{
	if(l==r)
	{
		scanf("%d",&t[rt]);
		return;
	}
	int mid=(l+r)/2;
	build(l,mid,rt<<1);
	build(mid+1,r,rt<<1|1);
	pushup(rt);
}

void update(int a,int num,int l,int r,int rt)//单点更新 
{
	if(l==r)
	{
		t[rt]=num;
		return;
	}
	int mid=(l+r)/2;
	if(a<=mid) update(a,num,l,mid,rt<<1);
	else update(a,num,mid+1,r,rt<<1|1);
	pushup(rt);
}

int query(int a,int b,int l,int r,int rt)
{
	if(a<=l&&r<=b)
		return t[rt];
	int mid=(l+r)/2;
	int ans=0;
	if(a<=mid) ans=max(ans,query(a,b,l,mid,rt<<1));
	if(b>mid) ans=max(ans,query(a,b,mid+1,r,rt<<1|1));
	return ans;
}

int main()
{
	scanf("%d%d",&n,&m);
	build(1,n,1);
	char c[2];
	int x,y;
	while(m--)
	{
		scanf("%s%d%d",c,&x,&y);
		if(c[0]=='U')
			update(x,y,1,n,1);
		else if(c[0]=='Q')
			printf("%d\n",query(x,y,1,n,1));
	}
	return 0;
}