树状数组【模板】

/*
 *******************
  *******************
   HDU 1166 敌兵布阵
  *******************
  *******************
  */
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
#define rep(i,j,k)for(i=j;i<k;i++)
#define per(i,j,k)for(i=j;i>k;i--)
#define MS(x,y)memset(x,y,sizeof(x))
#define max(a,b) a>b?a:b
#define min(a,b) a<b?a:b
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef long long LL;
const int INF=0x7ffffff;
#define lson rt<<1, l, m
#define rson rt<<1|1, m+1, r

const int M=5e4+1;
int i,j,k,n,m;
int a[M],c[M];

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

void update(int p,int x)
{
    while(p<=M){
        c[p]+=x;
        p+=lowbit(p);
    }
}

int sum(int p)
{
    int sum=0;
    while(p>0){
        sum+=c[p];
        p-=lowbit(p);
    }
    return sum;
}

int main()
{
    int T;
    int cas=1;
    char s[10];
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        MS(a,0);
        MS(c,0);
        for(i=1;i<=n;i++){
            scanf("%d",&m);
            a[i]+=m;
            update(i,m);
        }
        printf("Case %d:\n",cas++);
        while(~scanf("%s",s),s[0]!='E'){
            int a1,a2;
            scanf("%d%d",&a1,&a2);
            if(s[0]=='A'){
                a[a1]+=a2;
                update(a1,a2);
            }
            if(s[0]=='S'){
                a[a1]-=a2;
                update(a1,-a2);
            }
            if(s[0]=='Q'){
                printf("%d\n",sum(a2)-sum(a1-1));
            }
        }
    }
    return 0;
}