解题代码:
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <iostream>
#include <algorithm>
using namespace std;
#define maxn 200100
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
int MAX[maxn<<2];
int max(int a,int b){
return a>b? a:b;
}
void PushUP(int rt){
MAX[rt] = max(MAX[rt<<1],MAX[rt<<1|1]);
}
void Build(int l,int r,int rt){
if(l==r)
{
scanf("%d",&MAX[rt]);
return;
}
int m = (l+r)>>1;
Build(lson);
Build(rson);
PushUP(rt);
}
void Update(int p,int add,int l,int r,int rt){
if(l==r)
{
MAX[rt] = add;
return;
}
int m = (l+r)>>1;
if(p<=m)
Update(p,add,lson);
else
Update(p,add,rson);
PushUP(rt);
}
int Query(int L,int R,int l,int r,int rt)
{
if(L<=l && R>=r)
return MAX[rt];
int m = (l+r)>>1;
int ret = 0;
if(L<=m) ret = max(ret,Query(L,R,lson));
if(R> m) ret = max(ret,Query(L,R,rson));
return ret;
}
int main()
{
int n,m;
char s[5];
while(scanf("%d %d",&n,&m)!=EOF)
{
Build(1,n,1);
while(m--)
{
int a,b;
scanf(" %s %d %d",s,&a,&b);
if(s[0] == 'Q')
printf("%d\n",Query(a,b,1,n,1));
else
Update(a,b,1,n,1);
}
}
return 0;
}