树状数组板子hdu1166

#include<stdio.h>
#include<string.h>
#include<string>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<stdlib.h>
#include<time.h>
#include <iomanip>
#define lowbit(x) (x&(-x))
#define inf  0x7fffffff
#define linf 0x7fffffffffffffff
#define fill(x,y) memset(x,y,sizeof(x))
#define fup(i,x,y) for(int i=(x);i<=(y);i++)
#define fdn(i,x,y) for(int i=(x);i>=(y);i--)
#define sp(x) setprecision(x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define sc(n) scanf("%s",&n)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define pff(x) printf("%lf\n",x)
//#define N 200005
#define M 4000009
#define mod 9973
#define pi acos(-1)
#define eps 1e-2
//cout.setf(ios::fixed);
//freopen("out.txt","w",stdout);
using namespace std;
typedef long long ll;
typedef double db;
int tree[50005],n;
void add(int i,int val)
{
while(i<=n)
{
tree[i]+=val;
i+=lowbit(i);
}
}
int cal(int i)
{
int res=0;
while(i>=1)
{
res+=tree[i];
i-=lowbit(i);
}
return res;
}
int main()
{
int t,a,b,k=1;
char c[10];
scanf("%d",&t);
while(t--)
{
memset(tree,0,sizeof(tree));
printf("Case %d:\n",k++);
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a),add(i,a);
while(~scanf("%s",c))
{
if(c[0]=='E') break;
scanf("%d%d",&a,&b);
if(c[0]=='A') add(a,b);
else if(c[0]=='S') add(a,-b);
else if(c[0]=='Q') printf("%d\n",cal(b)-cal(a-1));
}

}
}