hdu 1166(线段树)

题解：单点修改模板题

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int N = 200000;
const int INF = 0x3f3f3f3f;
int s[N], l[N], r[N], a[N], l1, r1, u, x;
int flag;

void build(int k, int left, int right) {
	if (left == right) {
		s[k] = a[left];
		l[k] = r[k] = left;
		return;
	}
	int mid = (left + right) / 2;
	build(k * 2, left, mid);
	build(k * 2 + 1, mid + 1, right);
	s[k] = s[k * 2] + s[k * 2 + 1];
	l[k] = left;
	r[k] = right;
}

int query(int k, int left, int right) {
	if (l1 <= l[k] && r1 >= r[k])
		return s[k];
	int mid = (l[k] + r[k]) / 2;
	int ans = 0;
	if (l1 <= mid)
		ans += query(k * 2, left, mid);
	if (r1 > mid)
		ans += query(k * 2 + 1, mid + 1, right);
	return ans;	
}

void change(int k, int left, int right) {
	if (l[k] == u && r[k] == u) {
		if (flag == 1)
			s[k] += x;
		else if (flag == 2)
			s[k] -= x;
		return;
	}
	int mid = (l[k] + r[k]) / 2;
	if (u <= mid) {
		change(k * 2, left, mid);	
		if (flag == 1)
			s[k] += x;
		else if (flag == 2)
			s[k] -= x;
	}
	else {
		change(k * 2 + 1, mid + 1, right);
		if (flag == 1)
			s[k] += x;
		else if (flag == 2)	
			s[k] -= x;
	}
}

int main() {
	int t, n, cas = 1;
	scanf("%d", &t);
	while (t--) {
		printf("Case %d:\n", cas++);
		scanf("%d", &n);
		for (int i = 1; i <= n; i++)
			scanf("%d", &a[i]);
		build(1, 1, n);
		char c[10];
		while (1) {
			scanf("%s", c);
			if (c[0] == 'E')
				break;
			if (c[0] == 'Q') {
				scanf("%d%d", &l1, &r1);
				printf("%d\n", query(1, 1, n));
			}
			else if (c[0] == 'A') {
				scanf("%d%d", &u, &x);
				flag = 1;
				change(1, 1, n);
			}
			else if (c[0] == 'S') {
				scanf("%d%d", &u, &x);
				flag = 2;
				change(1, 1, n);
			}
		}
	}
	return 0;
}