洛谷 - 【模板】线段树 (区间修改与区间求和) 模板代码

模板题
最基础的线段树板子题

板子代码

#include <bits/stdc++.h>
inline long long read(){char c = getchar();long long x = 0,s = 1;
while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}
while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}
return x*s;}
using namespace std;
#define NewNode (TreeNode *)malloc(sizeof(TreeNode))
#define Mem(a,b) memset(a,b,sizeof(a))
#define lowbit(x) (x)&(-x)
const int N = 1e5 + 10;
const long long INFINF = 0x7f7f7f7f7f7f7f;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-7;
const unsigned long long mod = 998244353;
const double II = acos(-1);
const double PP = (II*1.0)/(180.00);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> piil;
ll Lazy[N<<2],ans[N<<2],a[N],n,m;
inline ll lc(ll x) {return x << 1;}//左孩子
inline ll rc(ll x) {return x << 1 | 1;}//右孩子
inline void push_up(ll x) {ans[x] = ans[lc(x)] + ans[rc(x)];}//向上更新节点信息
void Built(ll x,ll l,ll r)//建树
{
    Lazy[x] = 0;
    if(l == r) {ans[x] = a[l];return ;}
    ll Mid = (l+r)>>1;
    Built(lc(x),l,Mid);
    Built(rc(x),Mid+1,r);
    push_up(x);
}
inline void f(ll x,ll l,ll r,ll k)//更新节点值
{
    Lazy[x] += k;//懒标记
    ans[x] += ((r-l+1)*k);
}
inline void push_down(ll x,ll l,ll r)//向下更新节点值
{
    ll Mid = (l+r)>>1;
    f(lc(x),l,Mid,Lazy[x]);
    f(rc(x),Mid+1,r,Lazy[x]);
    Lazy[x] = 0;
}
void update(ll ln,ll rn,ll l,ll r,ll x,ll k)//更新节点函数
{
    if(ln <= l && r <= rn)
    {
        Lazy[x] += k;
        ans[x] += ((r-l+1)*k);
        return ;
    }
    push_down(x,l,r);
    ll Mid = (l+r)>>1;
    if(ln <= Mid) update(ln,rn,l,Mid,lc(x),k);
    if(Mid+1 <= rn) update(ln,rn,Mid+1,r,rc(x),k);
    push_up(x);
}
ll getsum(ll ln,ll rn,ll l,ll r,ll x)//求和
{
    ll sum = 0;
    if(ln <= l && r <= rn) {return ans[x];}
    ll Mid = (l+r)>>1;
    push_down(x,l,r);
    if(ln <= Mid) sum += getsum(ln,rn,l,Mid,lc(x));
    if(Mid+1 <= rn) sum += getsum(ln,rn,Mid+1,r,rc(x));
    return sum;
}
int main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin >> n >> m;
    for(int i = 1;i <= n;i++) cin >> a[i];
    Built(1,1,n);
    while(m--)
    {
        ll b,l,r,k;
        cin >> b;
        switch(b)
        {
            case 1:
            {
                cin >> l >> r >> k;
                update(l,r,1,n,1,k);
                break;
            }
            case 2:
            {
                cin >> l >> r;
                cout << getsum(l,r,1,n,1) << endl;
                break;
            }
        }
    }
}