题目:http://acm.hdu.edu.cn/showproblem.php?pid=1166
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 7;
int T, n;
int st[MAXN << 2];
void push_up(int root)
{
st[root] = st[root << 1] + st[root << 1 | 1];
}
void build(int root, int l, int r)
{
if(l == r)
{
cin >> st[root];
return;
}
int mid = l + (r - l) / 2;
build(root << 1, l, mid);
build(root << 1 | 1, mid + 1, r);
push_up(root);
}
void update(int root, int pos, int val, int l, int r)
{
if(l == r)
{
st[root] += val;
return ;
}
int mid = l + (r - l) / 2;
if(pos <= mid) update(root << 1, pos, val, l, mid);
else if(pos > mid) update(root << 1 | 1, pos, val, mid + 1, r);
push_up(root);
}
int query(int root, int ql, int qr, int l, int r)
{
if(ql <= l && qr >= r)
{
return st[root];
}
int mid = l + (r - l) / 2;
int ans = 0;
if(ql <= mid) ans += query(root << 1, ql, qr, l, mid);
if(qr > mid) ans += query(root << 1 | 1, ql, qr, mid + 1, r);
return ans;
}
int main()
{
cin >> T;
int Case = 0;
while(T--)
{
printf("Case %d:\n", ++Case);
cin >> n;
build(1, 1, n);
char s[10]; int i, j;
while(scanf("%s", s))
{
if(s[0] == 'E') break;
cin >> i >> j;
if(s[0] == 'A')
{
update(1, i, j, 1, n);
}
else if(s[0] == 'S')
{
update(1, i, -j, 1, n);
}
else if(s[0] == 'Q')
{
int ans = query(1, i, j, 1, n);
printf("%d\n", ans);
}
}
}
return 0;
}