P1253 扶苏的问题 （ 线段树

#include <bits/stdc++.h>
#define int_max 0x3f3f3f3f;
#define long_max 9223372036854775807;
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef unsigned long long ull;
const int MAXN = 1e6;
struct tree{
    int l,r;
    long long val,add,del;

}t[4*MAXN+2];
int a[4*MAXN+2];

void build(int p, int left ,int right){
    t[p].l = left , t[p].r = right , t[p].del = -long_max;
    if(left == right){
        t[p].val = a[left];
        return;
    }
    int mid = (left + right) >>1;
    build(p*2,left,mid);
    build(p*2+1,mid+1,right);
    t[p].val = max(t[p*2].val , t[p*2+1].val);
}
void spread(int p){

    if(t[p].del != -9223372036854775807){
        t[2*p].val = t[p].del;
        t[2*p+1].val = t[p].del;
        t[2*p].del = t[p].del;
        t[2*p+1].del = t[p].del;
        t[2*p].add = 0;
        t[2*p+1].add = 0;
        t[p].del = -9223372036854775807;
    }

    if(t[p].add != 0){
        t[2*p].val += t[p].add;
        t[2*p+1].val += t[p].add;
        t[2*p].add += t[p].add;
        t[2*p+1].add += t[p].add;
        t[p].add = 0;
    }

}

void change(int p,int left,int right,int v){
    if(left <= t[p].l && right >= t[p].r){
        t[p].val = v;
        t[p].add = 0;
        t[p].del = v;
        return;
    }
    spread(p);
    int mid = t[p].l + t[p].r >> 1;
    if(left <= mid) change(2*p,left,right,v);
    if(right > mid) change(2*p+1,left,right,v);
    t[p].val = max(t[p*2].val , t[p*2+1].val);
}
void add(int p , int left ,int right, int v){
    if(left <= t[p].l && right >= t[p].r){
        t[p].val = (ll) v + t[p].val;
        t[p].add = (ll) t[p].add + (ll)v;
        return;
    }
    spread(p);
    int mid = t[p].l + t[p].r >> 1;
    if(left <= mid) add(2*p,left,right,v);
    if(right > mid) add(2*p+1,left,right,v);
    t[p].val = max(t[p*2].val , t[p*2+1].val);
}
ll ask(int p,int left,int right){
    if(left <= t[p].l && right >= t[p].r){
        return t[p].val;
    }
    spread(p);
    int mid = t[p].l + t[p].r >> 1;
    ll a = -9223372036854775807,b = -9223372036854775807;
    if(left <= mid) a = ask(p*2,left,right);
    if(right > mid) b = ask(p*2+1,left,right);
    return max(a,b);
}

int n,m;
int main() {
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    build(1,1,n);

    while(m--){
        int op;
        cin>>op;
        if(op == 1){
            int l,r,x;
            cin>>l>>r>>x;
            change(1,l,r,x);
            //cout<<ask(1,1,n)<<"\n";
        }else if(op == 2){
            int l,r,x;
            cin>>l>>r>>x;
            //cout<<t[5].val <<" "<< t[5].l<<" "<< t[5].r<<"\n";
            add(1,l,r,x);
        }else{
            int l,r;
            cin>>l>>r;
            cout<<ask(1,l,r)<<"\n";
        }
    }
    return 0;
}

线段树维护区间最值，支持区间修改，区间add

用两个lazy  ，分别标记lazy  和 add

如果lazy 存在， 那么 lazy += add

如果add 存在 ，那么add = 0