[AcWing 4339] 敌兵布阵

单点修改（增加），区间查询（区间和）

线段树

---

点击查看代码

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;

const int N = 5e5 + 10;

int n;
int w[N];

struct Node
{
    int l, r;
    int sum;
} tr[N * 4];

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

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

void modify(int u, int x, int v)
{
    if (tr[u].l == tr[u].r)
        tr[u].sum += v;
    else {
        int mid = tr[u].l + tr[u].r >> 1;
        if (x <= mid)
            modify(u << 1, x, v);
        else
            modify(u << 1 | 1, x, v);
        pushup(u);
    }
}

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

void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i ++)
        cin >> w[i];
    bulid(1, 1, n);
    string op;
    while (cin >> op, op != "End") {
        int l, x;
        cin >> l >> x;
        if (op == "Add")
            modify(1, l, x);
        else if (op == "Sub")
            modify(1, l, -x);
        else
            printf("%d\n", query(1, l, x));
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    for (int C = 1; C <= T; C ++) {
        printf("Case %d:\n", C);
        solve();
    }

    // solve();

    return 0;
}

---

1. 只需要维护区间和 \(sum\) 即可