HDU - 1754 I Hate It （线段树点修改）

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node
{
    ll l, r, sum;
}a[1000005];
ll num[200005];
void build(ll loc, ll l, ll r)
{
    if(l == r)
    {
        a[loc].l = l;
        a[loc].r = r;
        a[loc].sum = num[l];
        return ;
    }
    else
    {
        a[loc].l = l;
        a[loc].r = r;
        ll mid = (l + r) / 2;
        build(loc * 2, l, mid);
        build(loc * 2 + 1, mid + 1, r);
        a[loc].sum = max(a[loc * 2].sum,a[loc * 2 + 1].sum);
    }
}
void ad(ll loc, ll x, ll p)
{
    ll l = a[loc].l, r = a[loc].r;
    if(l == r && l == x)
    {
        a[loc].sum = p;
        return ;
    }
    else
    {
        ll mid = (l + r) / 2;
        if(x <= mid)ad(loc * 2, x, p);
        else ad(loc * 2 + 1, x , p);
        a[loc].sum = max(a[loc * 2].sum,a[loc * 2 + 1].sum);
        return ;
    }
}
ll qu(ll loc, ll li, ll ri)
{
    ll l = a[loc].l, r = a[loc].r;
    if(l == li && r == ri)
    {
        return a[loc].sum;
    }
    else
    {
        ll mid = (l + r) / 2;
        if(ri <= mid)
        {
            return qu(loc * 2, li, ri);
        }
        else if(mid < li)
        {
            return qu(loc * 2 + 1, li, ri);
        }
        else return max(qu(loc * 2, li, mid),qu(loc * 2 + 1, mid + 1, ri));
    }
}
char s[1005];
int main()
{
    ll t, n, m, i, j, k,ca = 1;
    while(scanf("%lld %lld", &n, &m) != EOF)
    {
        for(i = 1; i <= n; i++)
        {
            scanf("%lld", &num[i]);
        }
        build(1, 1, n);
        for(k = 0; k < m; k++)
        {
            scanf("%s %lld %lld", s, &i, &j);
            if(strcmp(s, "Q") == 0)
            {
                printf("%lld\n", qu(1, i, j));
            }
            else ad(1, i, j);
        }
    }
    return 0;

}