I Hate It

#include<iostream>  
#include<cstdio>  
#include<algorithm>  
#include<cctype>  
using namespace std;    
int tree[800005];  
void build(int left,int right,int root)  
{  
    if(left==right)  
    {  
        scanf("%d",&tree[root]);  
    }  
    else  
    {  
        int mid=(left+right)>>1;  
        build(left,mid,root<<1);  
        build(mid+1,right,root<<1|1);  
        tree[root]=max(tree[root<<1],tree[root<<1|1]);  
    }  
}  
  
void update(int p,int add,int left,int right,int root)  
{  
    if(left==right)  
    {  
        tree[root]=add;  
    }  
    else  
    {  
        int mid=(left+right)>>1;  
        if(p<=mid)update(p,add,left,mid,root<<1);  
        else update(p,add,mid+1,right,root<<1|1);  
        tree[root]=max(tree[root<<1],tree[root<<1|1]);  
    }  
}  
  
int query(int x,int y,int left,int right,int root)  
{  
    if(x<=left&&right<=y)  
    {  
        return tree[root];  
    }  
    else  
    {  
        int sum=0,mid=(left+right)>>1;  
        if(x<=mid)sum=max(sum,query(x,y,left,mid,root<<1));  
        if(y>mid)sum=max(sum,query(x,y,mid+1,right,root<<1|1));  
        return sum;  
    }  
}  
  
int main()  
{    
    int n,m;  
    while(scanf("%d%d",&n,&m)!=EOF)  
    {  
        build(1,n,1);  
        while(m--)  
        {  
            char o[3];  
            int x,y;  
            scanf("%s%d%d",o,&x,&y);  
            if(o[0]==‘U‘)  
                update(x,y,1,n,1);  
            else  
                printf("%d\n",query(x,y,1,n,1));  
        }  
    }  
    return 0;  
}  

#include<stdio.h>  
#define Max 200001  
struct data  
{  
    int l,r,max;  
}node[3*Max];  
int score[Max];  
int max(int a,int b)  
{  
    return a>b? a:b;  
}  
void BuildTree(int left,int right,int u)  
{  
    node[u].l=left;  
    node[u].r=right;  
    if(left==right)  
    {  
        node[u].max=score[left];  
    }  
    else  
    {  
        BuildTree(left,(left+right)>>1,2*u);  
        BuildTree(((left+right)>>1)+1,right,2*u+1);  
        node[u].max=max(node[2*u].max,node[2*u+1].max);  
    }  
}  
void Update(int stu,int val,int u)  
{  
    node[u].max=max(val,node[u].max);  
    if(node[u].l==node[u].r)  
    {  
        return;  
    }  
    if(stu<=node[2*u].r)  
    {  
        Update(stu,val,2*u);  
    }  
    else  
    {  
        Update(stu,val,2*u+1);  
    }  
}  
int Query(int left,int right,int u)  
{  
    if(node[u].l==left&&node[u].r==right)  
    {  
        return node[u].max;  
    }  
    if(right<=node[2*u].r)  
    {  
        return Query(left,right,2*u);  
    }  
    if(left>=node[2*u+1].l)  
    {  
        return Query(left,right,2*u+1);  
    }  
    int mid=(node[u].l+node[u].r)>>1;  
    return max(Query(left,mid,2*u),Query(mid+1,right,2*u+1));  
}  
int main()  
{  
    int N,M;  
    while(scanf("%d%d",&N,&M)!=EOF)  
    {  
        int i;  
        for(i=1;i<=N;i++)  
        {  
            scanf("%d",&score[i]);  
        }  
        getchar();  
        char c;  
        int s,e;  
        BuildTree(1,N,1);  
        for(i=0;i<M;i++)  
        {  
            scanf("%c%d%d",&c,&s,&e);  
            getchar();  
            if(c==‘U‘)  
            {  
                Update(s,e,1);  
            }  
            if(c==‘Q‘)  
            {  
                printf("%d/n",Query(s,e,1));  
            }  
        }  
    }  
    return 0;  
}