hdu1166-敌兵布阵(线段树)

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<map>
#include<queue>
#include <deque>
#include <list>
#include <ctime>
#include <stack>
#include <vector>
#include<set>
#define Maxn 55555
#define MOD
typedef long long ll;
#define FOR(i,j,n) for(int i=j;i<=n;i++)
#define DFR(i,j,k) for(int i=j;i>=k;--i)
#define lowbit(a) a&-a
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
using namespace std;
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);
}
void update(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)update(p,add,lson);
    else update(p,add,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;
}
int main()
{   int T,n;
    scanf("%d",&T);
    FOR(cas,1,T)
    {printf("Case %d:\n",cas);
     scanf("%d",&n);
     build(1,n,1);
     char op[5];
     while(~scanf("%s",op))
     {
         if(op[0]=='E')break;
         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]=='S') update(a,-b,1,n,1);
         else update(a,b,1,n,1);
     }
    }
    return 0;
}