hdu 1754 I Hate It 线段树单点更新

//1093MS	4492K
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#define lch(x) ((x)<<1)
#define rch(x) ((x)<<1 | 1)
using namespace std;

const int MAX_N = 200000;
int tree[MAX_N<<2], a[MAX_N<<1];
int N, N2, M;

void init_N2(){
    N2 = 1;
    while(N2 < N) N2 <<= 1;
}

inline void push_up(int n){
    tree[n] = max(tree[lch(n)], tree[rch(n)]);
}

void build(int n, int l, int r){
    if(l == r){
        tree[n] = a[l];
        return;
    }
    int mid = (l+r)>>1;
    build(lch(n), l, mid);
    build(rch(n), mid+1, r);
    push_up(n);
}

void modify(int pos, int v){
    int p = pos + N2 - 1;
    while(p >= 1){
        tree[p] = v;
        p >>= 1;
    }
}

int query(int a, int b, int n, int l, int r){
    if(a <= l && r <= b) return tree[n];
    int mid = (l+r)>>1;
    if(b < mid+1) return query(a, b, lch(n), l ,mid);
    else if(mid < a) return query(a, b, rch(n), mid+1, r);
    else return max(query(a, b, lch(n), l ,mid), query(a, b, rch(n), mid+1, r));
}

int main(){
    while(~scanf("%d%d", &N, &M)){
        init_N2();
        for(int i=1; i<=N; i++)
            scanf("%d", &a[i]);
        memset(tree, 0, sizeof(tree));
        build(1, 1, N2);
        char str[5];
        int a, b;
        for(int i=1; i<=M; i++){
            scanf("%s%d%d", str, &a, &b);
            if(str[0] == 'Q'){
                printf("%d\n", query(a, b, 1, 1, N2));
            }
            else{
                modify(a, b);
            }
        }
    }
    return 0;
}