线段树模板

POJ：A Simple Problem with Integers

#include <iostream>
#define ll long long
using namespace std;

const int maxn = 100010;
ll data[maxn];
struct Node {
    int l, r;
    ll tag, val;
}nodes[maxn * 4];

void push_down(int id) {
    Node &cur = nodes[id], &left = nodes[id << 1], &right = nodes[id << 1 | 1];

    left.tag += cur.tag;
    right.tag += cur.tag;

    left.val += cur.tag * (left.r - left.l + 1);
    right.val += cur.tag * (right.r - right.l + 1);
    cur.tag = 0;
}

void push_up(int id) {
    nodes[id].val = nodes[id << 1].val + nodes[id << 1 | 1].val;
}

void build(int id, int l, int r) {
    nodes[id].l = l;
    nodes[id].r = r;

    if (l == r) {
        nodes[id].val = data[l];
        return;
    }

    int mid = (l + r) >> 1;
    build(id << 1, l, mid);
    build((id << 1) | 1, mid + 1, r);
    push_up(id);
    nodes[id].tag = 0;
}

ll query(int id, int qL, int qR) { // qL - query left

    int curL = nodes[id].l, curR = nodes[id].r;  // curL - current left
    int mid = (curL + curR) >> 1;
    ll ans = 0;
    if (qL <= curL && curR <= qR) {
        return nodes[id].val;
    }

    if (nodes[id].tag) {
        push_down(id);
    }

    if (qL <= mid) {
        ans += query(id << 1, qL, qR);
    }
    if (qR >= mid + 1) {
        ans += query(id << 1 | 1, qL, qR);
    }

    return ans;
}

void modify(int id, int target_pos, ll val) {
    int curL = nodes[id].l, curR = nodes[id].r;
    if (curL == curR) {
        nodes[id].val = val;
        return;
    }
    int mid = (curL + curR) >> 1;
    if (target_pos <= mid) {
        modify(id << 1, target_pos, val);
    } else {
        modify(id << 1 | 1, target_pos, val);
    }
    push_up(id);
}

void modify_interval(int id, int targetL, int targetR, ll val) {
    int curL = nodes[id].l, curR = nodes[id].r;

    if (targetL <= curL && curR <= targetR) {
        // 对于有tag的节点，其当前节点的val是更新过的，其子节点的val是未更新的。
        // 当前的val是正确的，更新过的！！
        nodes[id].tag += val;
        nodes[id].val += val * (nodes[id].r - nodes[id].l + 1);
        return;
    }
    if (nodes[id].tag) {
        push_down(id);
    }

    int mid = (curL + curR) >> 1;
    if (targetL <= mid) {
        modify_interval(id << 1, targetL, targetR, val);
    }
    if (mid + 1 <= targetR) {
        modify_interval(id << 1 | 1, targetL, targetR, val);
    }

    push_up(id);
}

int main() {


    int N, query_num;
    cin >> N >> query_num;
    for (int i = 1; i <= N; i++) {
        cin >> data[i];
    }

    build(1, 1, N);

    for (int i = 0; i < query_num; i++) {
        char c;
        int L, R, val;
        cin >> c;
        switch (c) {
            case 'Q':
                cin >> L >> R;
                cout << query(1, L, R) << endl;
                break;
            case 'C':
                cin >> L >> R >> val;
                modify_interval(1, L, R, val);
                break;
        }
    }
    return 0;
}