【线段树】HDU 1754 I Hate It

HDU 1754 I Hate It

• 单点修改，区间查询
• 线段树模板题

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <list>
#include <map>
#define INF 0x3f3f3f3f
#define P(x) x>0 ? x : 0
#define MID l + r >> 1
#define lsn rt << 1
#define rsn rt << 1 | 1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr

using namespace std;
typedef long long ll;
typedef vector<int>:: iterator VITer;
const int maxN=2e5+5;
int N,M;
int num[maxN];
int tree[maxN<<2];

void pushup(int rt) { tree[rt] = max(tree[lsn],tree[rsn]); }

void build_tree(int rt,int l,int r)
{
    if(l == r) { tree[rt] = num[l]; return; }
    int mid=MID;
    build_tree(Lson);
    build_tree(Rson);
    pushup(rt);
}

void update_point(int rt,int l,int r,int pos,int val)
{
    if(l==pos && r==pos) { tree[rt]=val; return; }
    int mid=MID;
    if(pos<=mid) update_point(Lson,pos,val);
    else if(pos > mid) update_point(Rson,pos,val);
    pushup(rt);
}

int query(int rt,int l,int r,int ql,int qr)
{
    if(ql <= l && qr >= r) return tree[rt];
    int mid=MID;
    if(qr<=mid) return query(QL);
    else if(ql>mid) return query(QR);
    else return max(query(QL),query(QR));
}

int main()
{
    while(~scanf("%d%d", &N, &M))
    {
        for(int i=1;i<=N;i++)
            scanf("%d",&num[i]);
        build_tree(1,1,N);
        while(M--)
        {
            char s[10];
            scanf("%s",s);
            int a,b;
            scanf("%d%d",&a,&b);
            if(s[0]=='U')
                update_point(1,1,N,a,b);
            else if(s[0]=='Q')
                printf("%d\n",query(1,1,N,a,b));
        }
    }
    return 0;
}