HDU 1754 I Hate It

单点修改，区间查询最大值。用线段树查询最大值。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int maxn = 222222;
using namespace std;
int max1[maxn<<2];
void Pushup(int rt)
{
    max1[rt] = max(max1[rt<<1],max1[rt<<1|1]);
}
void build(int l ,int r , int rt)
{
    if(l == r)
    {
        scanf("%d",&max1[rt]);
        return ;
    }
    int m = (l+r)>> 1 ;
    build(lson);
    build(rson);
    Pushup(rt);
}
void Update(int a, int b, int l,int r,int rt)
{
    if(l == r)
    {
        max1[rt] = b;
        return ;
    }
    int m = (l+r) >> 1;
    if(a <= m) Update(a,b,lson);
    else Update(a,b,rson);
    Pushup(rt);
}
int query(int L ,int R ,int l,int r, int rt)
{
    if(L <= l && r <= R)
    {
        return max1[rt];
    }
    int m = (l+r) >> 1;
    int res = 0;
    if(L <= m) res = max (res , query(L,R,lson));
    if(R > m) res = max (res , query(L,R,rson));
    return res;
}
int main()
{
    int n , q;
    while(~scanf("%d%d",&n,&q))
    {
        build(1,n,1);
        char op[2];
        int a,b;
        for(int i = 1 ; i <= q ; i++)
        {
            scanf("%s %d %d",op,&a,&b);
            if(op[0]=='Q') printf("%d\n",query(a,b,1,n,1));
            else if(op[0]=='U') Update(a,b,1,n,1);
        }
    }
    return 0;
}