线段树模板整理

#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<iostream>
#include<algorithm>
#include<map>
#include<queue>
#include<vector>
using namespace std;
typedef long long LL;
const LL MaxN = 1e5;
typedef struct{
    int l, r;
    LL sum, lazy;
    void update(LL C)
    {
        sum += 1LL*(r-l+1)*C;
        lazy += C;
    }
} Power;
Power segtree[MaxN<<2];
int n, q;
int num[MaxN+5];

void push_up(int x)
{
    segtree[x].sum = segtree[x<<1].sum + segtree[x<<1|1].sum;
}
void push_down(int x)
{
    int lazyval = segtree[x].lazy;
    if(lazyval){
        segtree[x<<1].update(lazyval);
        segtree[x<<1|1].update(lazyval);
        segtree[x].lazy = 0;
    }
}

//建树
void Build(int x, int l, int r)
{
    segtree[x].l = l, segtree[x].r = r;
    segtree[x].sum = segtree[x].lazy = 0;
    if(l == r){
        segtree[x].sum = num[l];
        return;
    }
    int mid = (l + r)/2;
    Build(x<<1, l, mid);
    Build(x<<1|1, mid+1, r);
    push_up(x);
}

//点修改，假设num[i]+C
void Update_point(int x, int i, int C)
{
    int l = segtree[x].l, r = segtree[x].r;
    if(l == r){
        segtree[x].sum += C;
        return;
    }
    int mid = (l+r)/2;
    if(i <= mid) Update_point(x<<1, i, C);
    else Update_point(x<<1|1, i, C);
    push_up(x);
}

//区间修改，假设num[L, R] += C
void Update_segment(int x, int L, int R, LL C)
{
    int l = segtree[x].l, r = segtree[x].r;
    if(l >= L && r <= R){
        segtree[x].update(C);
    }
    else{
        push_down(x);
        int mid = (l + r)/2;
        if(mid >= L) Update_segment(x<<1, L, R, C);
        if(mid < R) Update_segment(x<<1|1, L, R, C);
        push_up(x);
    }
}

//区间查询，假设查询num[L, R];
LL Query_segment(int x, int L, int R)
{
    int l = segtree[x].l, r = segtree[x].r;
    if(l >= L && r <= R){
        return segtree[x].sum;
    }
    else{
        push_down(x);
        LL ans = 0;
        int mid = (l + r)/2;
        if(mid >= L) ans += Query_segment(x<<1, L, R);
        if(mid < R) ans += Query_segment(x<<1|1, L, R);
        push_up(x);
        return ans;
    }
}

int main()
{
    cin >> n;
    for(int i = 1;i <= n;i++){
        scanf("%d", num + i);
    }
    Build(1, 1, n);
    scanf("%d", &q);
    for(int i = 1;i <= q;i++){
        int l, r, C;
        scanf("%d %d %d", &l, &r, &C);
        Update_segment(1, l, r, C);
        printf("%lld
", Query_segment(1, l, r));
    }
    return 0;
}