No3.线段树

这个应该算是很重要东西吧,因为老师还没有教树剖之类比较高级的用法,所以先写点简单的

单点查询和修改之类~

 

洛谷P1531 I Hate It

https://www.luogu.org/problemnew/show/P1531

这是最基础的,查询区间最值及单点修改,甚至lazytag都用不到... 

#include<cstdio>
#include<algorithm>
#include<iostream>
#define ls rt << 1
#define rs rt << 1 | 1
using namespace std;
inline int read(){
    char c = getchar();
    int f = 1,x = 0;
    while(c>'9' || c<'0'){if(c=='-')f = -1;c = getchar();}
    while(c<='9'&&c>='0'){x = x*10 + c-'0';c = getchar();}
    return x*f;
}
const int MAXN = 200005;
int n,m,tree[MAXN<<2],a[MAXN];
//向上更新 
void pushup(int rt){
    tree[rt] = max(tree[ls],tree[rs]); 
}
//建树 
void buildtree(int rt,int l,int r){
    if(l == r){
        tree[rt] = a[l];
        return;
    }
    int mid = (l + r) >> 1;
    buildtree(ls,l,mid);
    buildtree(rs,mid + 1,r);
    pushup(rt);
} 
//单点更新 
void update(int rt,int l,int r,int x,int to){
    if(x == l && x == r){
        tree[rt] = to;
        return;
    }
    int mid = (l + r) >> 1;
    if(x <= mid)update(ls,l,mid,x,to);
    else update(rs,mid + 1,r,x,to);
    pushup(rt);
}
//查询 
int query(int rt,int l,int r,int ql,int qr){
    if(l >= ql && r <= qr)return tree[rt];
    int mid = (l + r) >> 1;
    int lmax = 0,rmax = 0;
    if(mid >= ql)lmax = query(ls,l,mid,ql,qr);//如果左边还有没包括到的区间
    if(mid < qr)rmax = query(rs,mid + 1,r,ql,qr);//同上 右边
    return max(lmax,rmax);
}
int main(){
    n = read();m = read();
    for(int i = 1;i <= n;i++)a[i] = read();
    buildtree(1,1,n);
    for(int i = 0;i < m;i++){
        char C;cin >> C;//这题真是玄学...这里必须用cin
        //话说以后碰到回车空格之类的我再也不用getchar了!
        int A = read(),B = read();
        if(C == 'Q')printf("%d\n",query(1,1,n,A,B));
        else if(a[A] < B){
            a[A] = B;
            update(1,1,n,A,B);
        }
    }
    return 0;
}

 

区间乘法区间加法区间修改区间求和之类的过几天补上~