线段树

//线段树数组静态模板


#include <iostream>
#include <cstdio>
#define MAX 50003
#define ll long long

using namespace std;

struct node
{
    int w;
    int lch, rch;
}Tree[4*MAX];
ll ans;

void CreatTree(int l, int r, int i)
{
    int mid;

    Tree[i].lch = l;
    Tree[i].rch = r;
    if(l == r){
        scanf("%d",&Tree[i].w);
        return ;
    }
    mid = (l+r)>>1;
    CreatTree(l,mid,i<<1);
    CreatTree(mid+1,r,i<<1|1);
    Tree[i].w = Tree[i<<1].w+Tree[i<<1|1].w;
}

void QueryTree(int L, int R, int l, int r, int i)
{
    int mid;

    if(R<l || L>r)
        return ;
    if(L>=l&&R<=r){
        ans += Tree[i].w;
        return ;
    }
    mid = (L+R)>>1;
    QueryTree(L,mid,l,r,i<<1);
    QueryTree(mid+1,R,l,r,i<<1|1);
}

void UpdateTree(int L, int R, int pos, int num, int i)
{
    int mid;

    if(L == R){
        Tree[i].w += num;
        return ;
    }
    mid = (L+R)>>1;
    if(pos<=mid)
        UpdateTree(L,mid,pos,num,i<<1);
    else
        UpdateTree(mid+1,R,pos,num,i<<1|1);
    Tree[i].w = Tree[i<<1].w+Tree[i<<1|1].w;
}

int main()
{
    int i, n, t, a, b, k = 0;
    char str[10];

    scanf("%d",&t);
    while(t-- && scanf("%d",&n)){
        CreatTree(1,n,1);
        printf("Case %d:
",++k);
        while(scanf("%s",str),str[0]!='E'){
            scanf("%d %d",&a,&b);
            if(str[0] == 'Q'){
                ans = 0;
                QueryTree(1,n,a,b,1);
                printf("%lld
",ans);
            }
            else if(str[0] == 'A')
                UpdateTree(1,n,a,b,1);
            else
                UpdateTree(1,n,a,-b,1);
        }
    }
    return 0;
}