【数据结构】线段树 需要pushdown

建树	l==r	pushup
单点修改	l==r	pushup
区间查询	包		一旦题目中pushdown就必须pushdown，否则也无需
区间修改	包	pushup	pushdown

 AcWing 243. 一个简单的整数问题2 - AcWing

#include<iostream>
using namespace std;
#define ll  long long
struct Tree{
    int l,r;
    ll sum,add;
}tr[400001];
int n,m;
int a[100001];

void pushup(Tree& u,Tree& l,Tree &r){
    u.sum=l.sum+r.sum;
    
}

void pushup(int u){
    pushup(tr[u],tr[u*2],tr[u*2+1]);
    
}


void pushdown(Tree& u,Tree& l,Tree& r){
    if(u.add){
        l.add+=u.add;
        r.add+=u.add;
        
        l.sum+=u.add*(l.r-l.l+1);
        r.sum+=u.add*(r.r-r.l+1);
        
        u.add=0;
    }
}
void pushdown(int u){
    pushdown(tr[u],tr[u*2],tr[u*2+1]);
}
void bui(int u,int l,int r){
    tr[u]={l,r};
    if(l==r){
        tr[u]={l,r,a[l],0};
        return ;
    }
    int mid=(l+r)>>1;
    bui(u*2,l,mid);
    bui(u*2+1,mid+1,r);
    pushup(u);
}



void modify(int u,int x,int y,ll d){
    if(x<=tr[u].l&&tr[u].r<=y){
        tr[u].add+=d;
        tr[u].sum+=d*(tr[u].r-tr[u].l+1);
        return;
    }
    pushdown(u);
    int mid=(tr[u].l+tr[u].r)>>1;
    if(x<=mid)modify(u*2,x,y,d);
    if(y>=mid+1)modify(u*2+1,x,y,d);
    pushup(u);
    
}


ll query(int u,int x,int y){
    if(x<=tr[u].l&&tr[u].r<=y){
        
        return tr[u].sum;
    }
    
    pushdown(u);
    int mid=(tr[u].l+tr[u].r)>>1;
    ll res=0;
    if(x<=mid)res+=query(u*2,x,y);
    if(y>=mid+1)res+=query(u*2+1,x,y);
    return res;
}


int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++)cin>>a[i];
    
    bui(1,1,100000);
    while(m--){
        char op[2];
        scanf("%s",op);
        if(*op=='C'){
            int l,r;ll d;
            cin>>l>>r>>d;
            modify(1,l,r,d);
        }
        else {
            int l,r;
            cin>>l>>r;
            cout<<query(1,l,r)<<endl;
        }
    }
}

AcWing 1277. 维护序列 - AcWing 

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

typedef long long LL;

const int N = 100010;

int n, p, m;
int w[N];
struct Node
{
    int l, r;
    int sum, add, mul;
}tr[N * 4];

void pushup(int u)
{
    tr[u].sum = (tr[u << 1].sum + tr[u << 1 | 1].sum) % p;
}

void eval(Node &t, int add, int mul)
{
    t.sum = ((LL)t.sum * mul + (LL)(t.r - t.l + 1) * add) % p;
    t.mul = (LL)t.mul * mul % p;
    t.add = ((LL)t.add * mul + add) % p;
}

void pushdown(int u)
{
    eval(tr[u << 1], tr[u].add, tr[u].mul);
    eval(tr[u << 1 | 1], tr[u].add, tr[u].mul);
    tr[u].add = 0, tr[u].mul = 1;
}

void build(int u, int l, int r)
{
    if (l == r) tr[u] = {l, r, w[r], 0, 1};
    else
    {
        tr[u] = {l, r, 0, 0, 1};
        int mid = l + r >> 1;
        build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
        pushup(u);
    }
}

void modify(int u, int l, int r, int add, int mul)
{
    if (tr[u].l >= l && tr[u].r <= r) eval(tr[u], add, mul);
    else
    {
        pushdown(u);
        int mid = tr[u].l + tr[u].r >> 1;
        if (l <= mid) modify(u << 1, l, r, add, mul);
        if (r > mid) modify(u << 1 | 1, l, r, add, mul);
        pushup(u);
    }
}

int query(int u, int l, int r)
{
    if (tr[u].l >= l && tr[u].r <= r) return tr[u].sum;

    pushdown(u);
    int mid = tr[u].l + tr[u].r >> 1;
    int sum = 0;
    if (l <= mid) sum = query(u << 1, l, r);
    if (r > mid) sum = (sum + query(u << 1 | 1, l, r)) % p;
    return sum;
}

int main()
{
    scanf("%d%d", &n, &p);
    for (int i = 1; i <= n; i ++ ) scanf("%d", &w[i]);
    build(1, 1, n);

    scanf("%d", &m);
    while (m -- )
    {
        int t, l, r, d;
        scanf("%d%d%d", &t, &l, &r);
        if (t == 1)
        {
            scanf("%d", &d);
            modify(1, l, r, 0, d);
        }
        else if (t == 2)
        {
            scanf("%d", &d);
            modify(1, l, r, d, 1);
        }
        else printf("%d\n", query(1, l, r));
    }

    return 0;
}