【ICPC-425】hdu 1754 I Hate It

最新推荐文章于 2019-09-14 09:58:22 发布

原创最新推荐文章于 2019-09-14 09:58:22 发布 · 913 阅读

0 ·

CC 4.0 BY-SA版权

3. ACM-ICPC 专栏收录该内容

467 篇文章

订阅专栏

本文介绍了一道经典线段树题目HDU1754的解题思路，采用线段树实现单点更新和区间查询操作。通过具体代码详细展示了线段树的初始化、更新及查询过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

点击打开链接hdu 1754

思路: 线段树+单点更新

分析:

1 线段树的水题

代码：


/************************************************
 * By: chenguolin                               * 
 * Date: 2013-09-01                             *
 * Address: http://blog.youkuaiyun.com/chenguolinblog *
 ************************************************/
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

#define Lson(x) (x<<1)
#define Rson(x) (Lson(x)|1)
#define Mid(x,y) ((x+y)>>1)
#define Sum(x,y) (x+y)

const int MAXN = 200010;

int n , m;
int num[MAXN];
struct Node{
    int left;
    int right;
    int maxScore; 
};
Node node[4*MAXN];

void push_up(int pos){
    node[pos].maxScore = max(node[Lson(pos)].maxScore , node[Rson(pos)].maxScore);
}

void init(int left , int right , int pos){
    node[pos].left = left;
    node[pos].right = right;
    if(node[pos].left == node[pos].right){
        node[pos].maxScore = num[left];
        return;
    }
    int mid = Mid(left , right);
    init(left , mid , Lson(pos));
    init(mid+1 , right , Rson(pos));
    push_up(pos); 
}

void update(int index , int val , int pos){
    if(node[pos].left == node[pos].right){
        node[pos].maxScore = val;
        return;
    }
    int mid = Mid(node[pos].left , node[pos].right);
    if(index <= mid)
        update(index , val , Lson(pos));
    else
        update(index , val , Rson(pos));
    push_up(pos); 
}

int query(int left , int right , int pos){
    if(node[pos].left == left && node[pos].right == right) 
        return node[pos].maxScore;
    int mid = Mid(node[pos].left , node[pos].right);
    if(right <= mid)
        return query(left , right , Lson(pos));
    else if(left > mid)
        return query(left , right , Rson(pos));
    else
        return max(query(left , mid , Lson(pos)),query(mid+1 , right , Rson(pos)));
}

void input(){
    char c;
    int x , y;
    for(int i = 1 ; i <= n ; i++) 
        scanf("%d%*c" , &num[i]);
    init(1 , n , 1);
    while(m--){
        scanf("%c%d%d%*c" , &c , &x , &y);
        if(c == 'Q'){
            printf("%d\n" , query(x , y , 1));
        }
        else
            update(x , y , 1);
    }
}

int main(){
    while(scanf("%d%d" , &n , &m) != EOF)
        input();
    return 0;
}