hdu - 1166 敌兵布阵 线段树 点更新模板

题意：中文题

裸题，加减查询，点更新模板

链接：hdu 1166

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#define INF 0x3f3f3f3f
#define ll long long

using namespace std;

const int inf = 0x3f3f3f3f;
const int maxn = 50005;
const int maxm = 1000005;

int n, m, a[maxn];

struct node {
    int l, r;
    int v;
}tree[maxn << 2];

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

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

void update(int rt, int k, int v) {
    if(tree[rt].l == k && tree[rt].r == k) {
        tree[rt].v += v;
        return;
    }
    int mid = (tree[rt].l + tree[rt].r) >> 1;
    if(k <= mid)
        update(rt << 1, k, v);
    if(k > mid)
        update(rt << 1 | 1, k, v);
    pushup(rt);
}

int query(int rt, int l, int r) {
    if(tree[rt].l == l && tree[rt].r == r)
        return tree[rt].v;
    int mid = (tree[rt].l + tree[rt].r) >> 1;
    int res = 0;
    if(r <= mid)
        res += query(rt << 1, l, r);
    if(l > mid)
        res += query(rt << 1 | 1, l, r);
    if(l <= mid && r > mid)
        res += query(rt << 1, l, mid) + query(rt << 1 | 1, mid + 1, r);

    return res;
}

int main ()
{
    int T, kcase = 0;
    scanf("%d", &T);
    while(T--) {
        scanf("%d", &n);
        for(int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
        }
        build(1, 1, n);
        int b, c;
        char str[5];
        printf("Case %d:\n", ++kcase);
        while(~scanf("%s", str)) {
            if(str[0] == 'E') break;
            scanf("%d %d", &b, &c);
            if(str[0] == 'S') {
                update(1, b, -c);
            }
            else if(str[0] == 'A') {
                update(1, b, c);
            }
            else {
                printf("%d\n", query(1, b, c));
            }
        }
    }
    return 0;
}