敌兵布阵---hud1166（线段树或者树状数组模板）

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<iostream>

using namespace std;

#define N 50500
#define met(a, b) memset(a, b, sizeof(a))
int Tree
, n;

int lowbit(int x)
{
return x&(-x);
}

void Update(int pos, int num)
{
while(pos<=n)
{
Tree[pos]+=num;
pos += lowbit(pos);
}
}

int GetSum(int pos)
{
int s=0;
while(pos)
{
s += Tree[pos];
pos -= lowbit(pos);
}
return s;
}
int main()
{
int T, t=1;
scanf("%d", &T);
while(T--)
{
met(Tree, 0);
int num, pos, x, y;
scanf("%d", &n);
for(int i=1; i<=n; i++)
{
scanf("%d", &num);
Update(i, num);
}
printf("Case %d:\n", t++);
char s[110];
while(scanf("%s", s), s[0]!='E')
{
if(s[0]=='A')
{
scanf("%d %d", &pos, &num);
Update(pos, num);
}
if(s[0]=='S')
{
scanf("%d %d", &pos, &num);
Update(pos, -num);
}
if(s[0]=='Q')
{
scanf("%d %d", &x, &y);
int ans = GetSum(y)-GetSum(x-1);
printf("%d\n", ans);
}
}
}
return 0;
}