HDU 1754 线段树

原文链接: HDU 1754 线段树

上一篇: HDU 1561 依赖背包

下一篇: HDU 5616 dp/暴力枚举

http://blog.csdn.net/MetalSeed/article/details/8039326

http://blog.csdn.net/sunnyyoona/article/details/43936769?spm=5176.100239.blogcont3535.3.r4GmDx

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

#define Max 200001

//线段树节点,左右边界,和中点
struct IntervalTreeNode {
        int left,right,mid;
        int weight;               //表示该区间最大值
};

//线段树的节点数是区间长度的2倍多
IntervalTreeNode interval[3*Max];

// 把当前结点的信息更新到父结点
void PushUp(int num){
        // 左右子节点的最大值作为父节点的值
        interval[num].weight = max(interval[2*num].weight,interval[2*num+1].weight);
}

// 创建线段树
void Create(int left,int right,int num,int w[]){
        interval[num].left = left;
        interval[num].right = right;
        interval[num].mid = left + (right - left) / 2;
        // 叶子节点
        if(left == right) {
                interval[num].weight = w[left-1];
                return;
        }//if
        Create(left,interval[num].mid,2*num,w);
        Create(interval[num].mid+1,right,2*num+1,w);
        // 把当前结点的信息更新到父结点
        PushUp(num);
}
// 表示第pos个学生的成绩改为score
void Update(int pos,int score,int left,int right,int num){
        // 叶子节点
        if(left == right) {
                interval[num].weight = score;
                return;
        }
        // 左子区间
        int mid = interval[num].mid;
        if(pos <= mid) {
                Update(pos,score,left,mid,2*num);
        }
        // 右子区间
        else{
                Update(pos,score,mid+1,right,2*num+1);
        }
        // 子节点修改同时修改父节点
        PushUp(num);
}
// 查询区间[start,end]
int Query(int left,int right,int num){
        if(interval[num].left == left && interval[num].right == right) {
                return interval[num].weight;
        }
        if(right <= interval[num].mid) {
                return Query(left,right,2*num);
        }
        else if(left > interval[num].mid) {
                return Query(left,right,2*num+1);
        }
        else{
                return max(Query(left,interval[num].mid,2*num),Query(interval[num].mid+1,right,2*num+1));
        }
}


int main(){
        int N,M,a,b;
        char op[2];
        int score[Max];
        while(scanf("%d %d",&N,&M) != EOF) {
                // 学生
                for(int i = 0; i < N; ++i) {
                        scanf("%d",&score[i]);
                }
                // 创建线段树
                Create(1,N,1,score);
                // 操作
                for(int i = 0; i < M; ++i) {
                        //用字符串比字符的输入简单很多
                        scanf("%s %d %d",op,&a,&b);
                        if(op[0] == 'Q') {
                                cout<<Query(a,b,1)<<endl;
                        }
                        else if(op[0] == 'U') {
                                Update(a,b,1,N,1);
                        }
                }
        }
        return 0;
}

#include <iostream>
#include <cstdio>
#include <string.h>
#include <algorithm>

#define LL long long
int const MAX = 2e5+1;

using namespace std;

int score[MAX];

//线段树节点
struct Node {
        //区间左右端点,中点和该区间最大值
        int left,right,mid,maxval;
};

//节点数是区间长度的2倍多
Node tree[MAX*3];

//更新节点root的maxval
void pushUp(int root){
        //该节点的最大值是左右节点中的最大值
        tree[root].maxval=max(tree[root*2].maxval,tree[root*2+1].maxval);
}

//创建线段树,cnt是节点编号,val是数值数组1--n
void create(int left,int right,int cnt,int val[]){
        tree[cnt].left = left;
        tree[cnt].right = right;
        tree[cnt].mid = left + (right - left) / 2;
//叶子节点
        if( left == right ) {
                tree[cnt].maxval = val[left];
                return;
        }

        //不是叶子节点,递归建树
        create(left,tree[cnt].mid,2*cnt,val);
        create(tree[cnt].mid+1,right,2*cnt+1,val);

        //更新该节点的最大值
        pushUp(cnt);
}

//修改第pos个节点的值为score,区间范围left--right,开始节点是cnt
void update(int pos,int score,int left,int right,int cnt){
        if( left == right ) {
                tree[cnt].maxval = score;
                return;
        }
        int mid = tree[cnt].mid;
        //节点的区间是左闭右开的
        if(pos<=mid) {
                update(pos,score,left,mid,cnt*2);
        }else{
                update(pos,score,mid+1,right,cnt*2+1);
        }
        pushUp(cnt);
}

//查询区间最大值
int query(int left,int right,int cnt){
        //如果刚好是树的一个节点,返回即可
        if ( tree[cnt].left == left && tree[cnt].right == right ) {
                return tree[cnt].maxval;
        }

        if ( right <= tree[cnt].mid ) {
                return query(left,right,2*cnt);
        }
        else if ( left > tree[cnt].mid ) {
                return query(left,right,2*cnt+1);
        }else {
                return max(query(left,tree[cnt].mid,2*cnt),query(tree[cnt].mid+1,right,2*cnt+1));
        }

}
int main(int argc, char *argv[])
{
//        freopen("in.txt","r",stdin);
//        freopen("out.txt","w",stdout);

        int n,m,x,y;
        char op[2];
        while( scanf("%d %d",&n,&m) == 2) {
                for (int i = 1; i<=n; i++ ) {
                        scanf("%d",score+i);
                }

                create(1,n,1,score);

                while( m-- ) {
                        scanf("%s %d %d",op,&x,&y );
                        if(op[0]=='Q') {
                                printf("%d\n",query(x,y,1));
                        }else if(op[0]=='U') {
                                update(x,y,1,n,1);
                        }
                }

        }

        return 0;
}