vijos 1659 河蟹王国 线段树区间加、区间查询最大值

题目链接:

https://vijos.org/p/1659

题意:

题解:

线段树，区间更新（加/减），区间查询最大值

代码:

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
typedef long long ll;
#define MS(a) memset(a,0,sizeof(a))
#define MP make_pair
#define PB push_back
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
    ll 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();}
    return x*f;
}
//////////////////////////////////////////////////////////////////////////
const int maxn = 1e5+10;

ll a[maxn];

struct node{
    int l,r;
    ll mx,lazy;
    void update(ll val){
        mx = val+mx;
        lazy += val;
    }
}tree[maxn<<2];

void pushup(int rt){
    tree[rt].mx = max(tree[rt<<1].mx, tree[rt<<1|1].mx);
}

void pushdown(int rt){
    int lazyval = tree[rt].lazy;
    if(lazyval){
        tree[rt<<1].update(lazyval);
        tree[rt<<1|1].update(lazyval);
        tree[rt].lazy = 0;
    }
}

void build(int rt, int l, int r){
    tree[rt].l = l, tree[rt].r = r;
    tree[rt].mx = 0, tree[rt].lazy = 0;
    if(l == r){
        tree[rt].mx = a[l];
    }else{
        int mid = (l+r)/2;
        build(rt<<1,l,mid);
        build(rt<<1|1,mid+1,r);
        pushup(rt);
    }
}

void update(int rt,int l,int r,ll val){
    int L = tree[rt].l, R = tree[rt].r;
    if(l<=L && R<=r){
        tree[rt].update(val);
    }else{
        pushdown(rt);
        int mid = (L+R)/2;
        if(l <= mid) update(rt<<1,l,r,val);
        if(r > mid) update(rt<<1|1,l,r,val);
        pushup(rt);
    }
}

ll query(int rt,int l,int r){
    int L = tree[rt].l, R = tree[rt].r;
    if(l<=L && R<=r){
        return tree[rt].mx;
    }else{
        ll ans = 0;
        pushdown(rt);
        int mid = (L+R)/2;
        if(r<=mid)return query(rt<<1,l,r);
        else if(l>mid)return query(rt<<1|1,l,r);
        else return max(query(rt<<1,l,mid),query(rt<<1|1,mid+1,r));
    }
}
/* 这样就WA */
// ll query(int rt,int l,int r){
//     int L = tree[rt].l, R = tree[rt].r;
//     if(l<=L && R<=r)
//         return tree[rt].v;
//     else{
//         ll ans = 0;
//         pushdown(rt);
//         int mid = (L+R)/2;
//         if(l <= mid) ans = max(ans,query(rt<<1,l,r)); 
//         if(r > mid) ans = max(ans,query(rt<<1|1,l,r));
//         pushup(rt);
//         return ans;
//     }
// }

int main(){
    int n=read(),q;
    for(int i=1; i<=n; i++)
        a[i] = read();
    build(1,1,n);
    q = read();
    while(q--){
        int op,a,b,v;
        op = read();
        if(op == 1){
            a=read(),b=read(),v=read();
            update(1,a,b,v);
        }else{
            a=read(),b=read();
            ll ans = query(1,a,b);
            printf("%lld\n",ans);
        }
    }

    return 0;
}