HDU-1166 적병 배치

#include<stdio.h>
#include<string.h>
#define N 50005
int a[N]; char s[10]; int n; int lower_bit(int i) { return i&(-i); } void add(int i,int v) { while(i<=n) {
        a[i]+=v;
        i+=lower_bit(i); } } int sum(int i) { int s=0; while(i>0) {
        s+=a[i];
        i-=lower_bit(i); } return s; } int main() { int t;
    scanf("%d",&t); int k=1; while(t--) { int i,v;
        memset(a,0,sizeof(a));
        scanf("%d",&n); for(i=1;i<=n;i++) {
            scanf("%d",&v);
            add(i,v); } int x,y;
        printf("Case %d:
",k++); while(scanf("%s",s)!=EOF&&s[0]!='E') { if(s[0]=='Q') {
                scanf("%d%d",&x,&y);
                printf("%d
",sum(y)-sum(x-1)); } if(s[0]=='A') {
                scanf("%d%d",&x,&y);
                add(x,y); } if(s[0]=='S') {
                scanf("%d%d",&x,&y);
                add(x,-y); } } } return 0; }

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int MAX=50005;
int sum[MAX<<2];
char s[9];
void push(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);
    push(rt);
}
void updata(int p,int add,int l,int r,int rt)
{
    if(l==r)
    {
        sum[rt]+=add;
        return;
    }
    int m=(l+r)>>1;
    if(p<=m)
        updata(p,add,lson);
    else
        updata(p,add,rson);
    push(rt);
}
int querty(int L,int R,int l,int r,int rt)
{
    if(L<=l&&R>=r)
    {
        return sum[rt];
    }
    int m=(l+r)>>1;
    int cnt=0;
    if(L<=m)
        cnt+=querty(L,R,lson);
    if(R>m)
        cnt+=querty(L,R,rson);
    return cnt;
}
int main()
{
    int t,k=1;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d",&n);
        build(1,n,1);
        int x,y;
        printf("Case %d:
",k++);
        while(scanf("%s",s)!=EOF&&s[0]!='E')
        {
            scanf("%d%d",&x,&y);
            if(s[0]=='S')
                updata(x,-y,1,n,1);
            if(s[0]=='A')
                updata(x,y,1,n,1);
            if(s[0]=='Q')
                printf("%d
",querty(x,y,1,n,1));
        }
    }
    return 0;
}