HDU 1166 敌兵布阵 树状数组

#include <bits/stdc++.h>
using namespace std;

const int N = 5e4 + 10;
int t,n,tmp,i,j;
int c[N];
int lowbit(int i){
    return (i&-i);
}

void add(int i,int data){
    while(i<=n){
        c[i] += data;
        i += lowbit(i);
    }
}

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

int main(){
    scanf("%d",&t);
    for(int cnt=1;cnt<=t;cnt++){
        printf("Case %d:\n",cnt);
        scanf("%d",&n);
        for(i=1;i<=n;i++){
            scanf("%d",&tmp);
            add(i,tmp);
        }

        char str[10];
        while(1){
            scanf(" %s",str);
            if(str[0] == 'E')break;

            scanf("%d %d",&i,&j);
            if(str[0] == 'A'){add(i,j);continue;}
            if(str[0] == 'S'){add(i,-j);continue;}
            if(str[0] == 'Q'){printf("%d\n",getSum(j) - getSum(i-1));continue;}
        }
        memset(c,0,sizeof(c));
    }
    return 0;
}