【线段树】243. 一个简单的整数问题2

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <bitset>


using namespace std;

const int N = 1e5 + 100;

using ll = long long;
int n, m;

ll w[N];

struct Node {
    ll l, r;
    ll sum, add; // add为懒标记
} tr[N * 4];


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

inline void pushup(ll u) {
    pushup(tr[u], tr[u << 1], tr[u << 1 | 1]);
}

inline void pushdown(ll u) {
    auto &root = tr[u], &left = tr[u << 1], &right = tr[u << 1 | 1];
    if (root.add) {
        left.add += root.add, left.sum += (ll) (left.r - left.l + 1) * root.add;
        right.add += root.add, right.sum += (ll) (right.r - right.l + 1) * root.add;
        root.add = 0;
    }
}

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

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

ll query(ll u, ll l, ll r) {
    if (tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
    else {
        pushdown(u);
        ll mid = tr[u].l + tr[u].r >> 1;
        ll sum = 0;
        if (l <= mid) sum += query(u << 1, l, r);
        if (r > mid) sum += query(u << 1 | 1, l, r);
        return sum;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> w[i];
    build(1, 1, n);
    string op;
    int l, r;
    ll d;
    while (m--) {
        cin >> op;
        cin >> l >> r;
        if (op == "C") {
            cin >> d;
            modify(1, l, r, d);
        } else {
            cout << query(1, l, r) << endl;
        }
    }
    return 0;
}