【模板】线段树 1 洛谷P3372 线段树

【模板】线段树 1

code

/*Siberian Squirrel*/
/*Cute KiloFish*/
#include<bits/stdc++.h>

#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define ACM_LOCAL

using namespace std;
typedef long long ll;

const double PI = acos(-1);
const double eps = 1e-4;
/*const int MOD = 998244353, r = 119, k = 23, g = 3;
const int MOD = 1004535809, r = 479, k = 21, g = 3;*/
const int MOD = 1e9 + 7;
const int M = 1e7 + 10;
const int N = 3e5 + 10;

//inline int rnd(){static int seed=2333;return seed=(((seed*666666ll+20050818)%998244353)^1000000007)%1004535809;}

struct node {
    
    
    int l, r;
    ll sum, lazy;
}seg[N << 2];
ll a[N];

void pushup(int rt) {
    
    
    seg[rt].sum = seg[rt << 1].sum + seg[rt << 1 | 1].sum;
}

void pushdown(int rt) {
    
    
    if(seg[rt].lazy) {
    
    
        seg[rt << 1].lazy += seg[rt].lazy;
        seg[rt << 1 | 1].lazy += seg[rt].lazy;
        seg[rt << 1].sum += seg[rt].lazy * (seg[rt << 1].r - seg[rt << 1].l + 1);
        seg[rt << 1 | 1].sum += seg[rt].lazy * (seg[rt << 1 | 1].r - seg[rt << 1 | 1].l + 1);
        seg[rt].lazy = 0;
    }
}

void build(int rt, int l, int r) {
    
    
    seg[rt] = {
    
    l, r, 0, 0};
    if(l == r) {
    
    
        seg[rt].sum = a[l];
        return;
    }
    int mid = l + r >> 1;
    build(rt << 1, l, mid);
    build(rt << 1 | 1, mid + 1, r);
    pushup(rt);
}

void modify(int rt, int l, int r, ll x) {
    
    
    if(l <= seg[rt].l && seg[rt].r <= r) {
    
    
        seg[rt].sum += x * (seg[rt].r - seg[rt].l + 1);
        seg[rt].lazy += x;
        return ;
    }
    pushdown(rt);
    int mid = seg[rt].l + seg[rt].r >> 1;
    if(l <= mid) modify(rt << 1, l, r, x);
    if(mid < r) modify(rt << 1 | 1, l, r, x);
    pushup(rt);
}

ll query(int rt, int l, int r) {
    
    
    if(l <= seg[rt].l && seg[rt].r <= r) {
    
    
        return seg[rt].sum;
    }
    pushdown(rt);
    int mid = seg[rt].l + seg[rt].r >> 1;
    ll res = 0;
    if(l <= mid) res += query(rt << 1, l, r);
    if(mid < r) res += query(rt << 1 | 1, l, r);
    return res;
}

int n, m, op;
int l, r, x;

void solve() {
    
    
    if(op == 1) {
    
    
        cin >> x;
        modify(1, l, r, x);
    } else if(op == 2) {
    
    
        cout << query(1, l, r) << endl;
    }
}

int main() {
    
    
    IO;
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    int o = 1, cases = 0;
//    cin >> o;
    while(o --) {
    
    
        cin >> n >> m;
        for(int i = 1; i <= n; ++ i) cin >> a[i];
        build(1, 1, n);
        for(int i = 1; i <= m; ++ i) {
    
    
            cin >> op >> l >> r;
            solve();
        }
    }
    return 0;
}