HDU 1166 敌兵布阵(单点更新，区间和查询 模板)

//#include<bits/stdc++.h>
#include<algorithm>
#include<stdio.h>
#include<string.h>

#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1

const int MAXN = 50007;
int sum[MAXN<<2];

void Pushup(int rt)
{
    sum[rt] = sum[rt<<1] + sum[rt<<1|1];
}

void Build(int l,int r,int rt)
{
    if(l == r)
    {
        scanf("%d",&sum[rt]);
        return;
    }
    int m = (l+r)>>1;
    Build(lson);
    Build(rson);
    Pushup(rt);
}

int Query(int L,int R,int l,int r,int rt)
{
    if(l >= L && r <= R)
        return sum[rt];
    int m = (l+r)>>1;
    int ret = 0;
    if(L <= m)
        ret += Query(L,R,lson);
    if(R > m)
        ret += Query(L,R,rson);
    return ret;
}

void Update(int num,int add,int l,int r,int rt)
{
    if(l == r)
    {
        sum[rt] += add;
        return;
    }
    int m = (l+r)>>1;
    if(num <= m)
        Update(num,add,lson);
    else Update(num,add,rson);
    Pushup(rt);
}

int main()
{
    int T;
    scanf("%d",&T);
    int cas = 1;
    while(T--)
    {
        char op[5];
        int n;
        scanf("%d",&n);
        Build(1,n,1);
        printf("Case %d:\n",cas++);
        while(scanf("%s",op) && op[0] != 'E')
        {
            int a,b;
            scanf("%d%d",&a,&b);
            if(op[0] == 'Q')
                printf("%d\n",Query(a,b,1,n,1));
            else if(op[0] == 'A')
                Update(a,b,1,n,1);
            else if(op[0] == 'S')
                Update(a,-b,1,n,1);
            //else if(op[0] == 'E')
              //  return 0;
        }
    }
    return 0;
}//#include<bits/stdc++.h>
#include<algori