hdu1754 I Hate It 线段树，单点更新

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1754

///2014.5.29
///hdu1754

#include <cstdio>
#include <algorithm>
using namespace std;

#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1

const int maxn = 205000;
int sum[maxn<<2];

void PushUP(int rt) {
    sum[rt] = sum[rt<<1] > sum[rt<<1|1] ? sum[rt<<1] : sum[rt<<1|1];
}
void build(int l,int r,int rt) {
    if (l == r) {
        scanf("%d",&sum[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) {
        sum[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 sum[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()
{
    // freopen("in","r",stdin);
    int n,M;
    while( scanf("%d%d",&n,&M) != EOF ) {
        build(1 , n , 1);
        char op[3];
        while( M-- ) {
            scanf("%s",op);
            int a , b;
            scanf("%d%d",&a,&b);
            if (op[0] == 'Q') printf("%d\n",query(a , b , 1 , n , 1));
            else update(a , b , 1 , n , 1);
        }
    }
    return 0;
}