HDU-1754：I Hate It

单点跟新的一点小变形，当成单点跟新来写稍微改下就行

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

#define maxn 200000
int v[maxn+100];

struct tr
{
    int R,L,M;
}tree[maxn*3];

void build(int nood,int l,int r)
{
    tree[nood].L=l;
    tree[nood].R=r;
    if(l==r) {tree[nood].M=v[l];return;}
    build(nood*2,l,(l+r)/2);
    build(nood*2+1,(l+r)/2+1,r);
    tree[nood].M=max(tree[nood*2].M,tree[nood*2+1].M);
}

void Insert(int nood,int i,int k)
{
    tree[nood].M=max(k,tree[nood].M);
    if(tree[nood].L==i&&tree[nood].R==i) return;
    else if((tree[nood].L+tree[nood].R)/2<i) Insert(nood*2+1,i,k);
    else Insert(nood*2,i,k);
}

int MAX(int nood,int l,int r)
{
    if(tree[nood].R==r&&tree[nood].L==l) return tree[nood].M;
    else if((tree[nood].L+tree[nood].R)/2<l) return MAX(nood*2+1,l,r);
    else if((tree[nood].L+tree[nood].R)/2>=r) return MAX(nood*2,l,r);
    else return max(MAX(nood*2,l,(tree[nood].L+tree[nood].R)/2),MAX(nood*2+1,(tree[nood].L+tree[nood].R)/2+1,r));
}

int main()
{
    int n,i,m,k;
    char str;
    while(~scanf("%d%d",&n,&m))
    {
        for(i=1;i<=n;i++) scanf("%d",&v[i]);
        build(1,1,n);
        while(m--)
        {
            getchar();
            scanf("%c",&str);
            scanf("%d%d",&i,&k);
            if(str=='U') Insert(1,i,k);
            else
            {
                int ss=MAX(1,i,k);
                printf("%d\n",ss);
            }
        }
    }
    return 0;
}