hdu 1166（线段树）

入门级的。。。。。不解释。。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define LL(x) (x<<1)
#define RR(x) (x<<1|1)
#define M 50005
struct node{
    int L,R,sum;
}edge[M<<2];
int num[M];
int buit(int L,int R,int i){
    edge[i].L=L,edge[i].R=R;
    if(L==R) return edge[i].sum=num[L];
    int mid=(L+R)/2;
    return edge[i].sum=buit(L,mid,LL(i))+buit(mid+1,R,RR(i));
}
void updata(int id,int x,int i){
    edge[i].sum+=x;
    if(edge[i].L==edge[i].R) return;
    int mid=(edge[i].L+edge[i].R)/2;
    if(id<=mid) updata(id,x,LL(i));
    else updata(id,x,RR(i));
}
int query(int L,int R,int i){
    if(L==edge[i].L && R==edge[i].R) return edge[i].sum;
    int mid=(edge[i].L+edge[i].R)/2;
    if(R<=mid) return query(L,R,LL(i));
    else if(L>mid) return query(L,R,RR(i));
    else return query(L,mid,LL(i))+query(mid+1,R,RR(i));
}
int main(){
    int cas,n,i,j,x,y;
    char s[10];
    scanf("%d",&cas);
    for(i=1;i<=cas;i++){
        printf("Case %d:\n",i);
        scanf("%d",&n);
        for(j=1;j<=n;j++) scanf("%d",&num[j]);
        buit(1,n,1);
        while(scanf("%s",s) && s[0]!='E'){
            scanf("%d%d",&x,&y);
            if(s[0]=='A') updata(x,y,1);
            else if(s[0]=='S') updata(x,-y,1);
            else printf("%d\n",query(x,y,1));
        }
    }
    return 0;
}