hdu 1754 I Hate It

题目链接：点这里

【分析】
很明显的线段树，而且是点更新区间查询，维护区间最大值，没什么好说的，算是入门题了。

【代码】

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string.h>
#include<algorithm>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<time.h>
#include<stack>
#include<set>
#include<map>
#include<queue>
#include<sstream>
using namespace std;
#define rep0(i,l,r) for(int i = (l);i < (r);i++)
#define rep1(i,l,r) for(int i = (l);i <= (r);i++)
#define rep_0(i,r,l) for(int i = (r);i > (l);i--)
#define rep_1(i,r,l) for(int i = (r);i >= (l);i--)
#define MS0(a) memset(a,0,sizeof(a))
#define MS1(a) memset(a,-1,sizeof(a))
#define MSi(a) memset(a,0x3f,sizeof(a))
#define sin1(a) scanf("%d",&(a))
#define sin2(a,b) scanf("%d%d",&(a),&(b))
#define sll(a) scanf("%lld",&(a))
#define sll2(a,b) scanf("%lld%lld",&(a),&(b))
#define sdo(a) scanf("%lf",&(a))
#define sdo2(a,b) scanf("%lf%lf",&(a),&(b))
#define inf 0x3f3f3f3f
#define lson l, m, rt << 1
#define rson m+1, r, rt << 1|1
#define uint unsigned int
typedef pair<int,int> PII;
#define A first
#define B second
#define pb push_back
#define MK make_pair
#define ll long long
template<typename T>
void read1(T &m)
{
    T x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        x=x*10+ch-'0';
        ch=getchar();
    }
    m = x*f;
}
template<typename T>
void read2(T &a,T &b)
{
    read1(a);
    read1(b);
}
template<typename T>
void read3(T &a,T &b,T &c)
{
    read1(a);
    read1(b);
    read1(c);
}
template<typename T>
void out(T a)
{
    if(a>9) out(a/10);
    putchar(a%10+'0');
}
template<typename T>
void outn(T a)
{
    if(a>9) out(a/10);
    putchar(a%10+'0');
    puts("");
}
using namespace std;
int num[200005];
typedef struct
{
    int l;
    int r;
    int maxm;
} P;
P tree[820000];
void buildtree(int ind,int l,int r)
{
    if(l==r)
    {
        tree[ind].l=tree[ind].r=l;
        tree[ind].maxm=0;
        return ;
    }
    tree[ind].l=l;
    tree[ind].r=r;
    tree[ind].maxm=0;
    int mid=(l+r)>>1;
    buildtree(ind<<1,l,mid);
    buildtree(ind<<1|1,mid+1,r);
}
void update(int ind,int maxm,int flag)
{
    tree[flag].maxm=max(maxm,tree[flag].maxm);
    if(tree[flag].l==tree[flag].r&&tree[flag].l==ind)
        return ;
    if((tree[flag].l+tree[flag].r)>>1 < ind)
        update(ind,maxm,flag<<1|1);
    else update(ind,maxm,flag<<1);
}
int getmax(int l,int r,int flag)
{
    if(l>tree[flag].r||r<tree[flag].l)
        return 0;
    if(l<=tree[flag].l&&r>=tree[flag].r)
        return tree[flag].maxm;
    return max(getmax(l,r,flag<<1),getmax(l,r,flag<<1|1));
}
int main()
{
//    freopen("in.txt","r",stdin);
    int len,que;
    while(sin2(len,que)!=EOF)
    {
        buildtree(1,1,len);
        rep1(i,1,len)
        {
            read1(num[i]);
            update(i,num[i],1);
        }
        while(que--)
        {
            char a;
            int b,c;
            scanf("%c",&a);
            read2(b,c);
            if(a=='Q') outn(getmax(b,c,1));
            else update(b,c,1);
        }
    }
    return 0;
}