【悬关】深夜爆肝线段树模版1，样例过抱灵求条

#include <bits/stdc++.h>
#define int long long
using namespace std;

int n, m;
int op, x, y , z;
int t[400005];
int a[100005];
int la[400005];


void push_up(int k)
{
    t[k] = t[k * 2] + t[k * 2 + 1];
}

void push_down(int k, int l, int r)
{
    int mid = l + r >> 1;
    t[k * 2] += (mid - l + 1) * la[k];
    t[k * 2 + 1] += (r - mid) * la[k];
    la[k * 2] += la[k];
    la[k * 2 + 1] += la[k];
    la[k] = 0;
}

void build(int k ,int l, int r)
{
    if(l == r)
    {
        t[k] = a[l];
        return;
    }
    int mid = l + r >> 1;
    build(k * 2, l, mid);
    build(k * 2 + 1, mid + 1, r);
    push_up(k);
}

void upd(int k, int l, int r)
{
    if(y < l || r < x) return;
    if(l >= x && r <= y)
    {
        la[k] += z;
        t[k] += z;
        return;
    }

    if(la[k]) push_down(k, l, r);
    int mid = l + r >> 1;
    upd(k * 2, l, mid);
    upd(k * 2 + 1, mid + 1, r);
    push_up(k);
}

int query(int k, int l, int r)
{
    if(l >= x && y >= r) return t[k];
    if(y < l || r < x) return 0;
    if(la[k]) push_down(k, l, r);
    int mid = l + r >> 1;
    return query(k * 2, l, mid) + 
    query(k * 2 + 1, mid + 1, r);
}

signed main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    build(1, 1, n);
    while(m--)
    {
        cin >> op >> x >> y;
        if(op == 1)
        {
            cin >> z;
            upd(1, 1, n);
        }
        else
        {
            cout << query(1, 1, n) << '\n';
        }
    }

    return 0;
}