hdu1166敌兵布阵

单点修改，区间查询的线段树实现，自己的第一颗线段树。。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>

using namespace std;
const int maxn = 50000+10;
int T,n,a[maxn],tree[maxn<<2],x,y;
void pushUp(int cur)
{
   tree[cur]=tree[cur*2]+tree[cur*2+1];
}
void build(int left,int right, int cur)
{
    if(left==right)
        {
            tree[cur]=a[left];
            return ;
        }
    int m=left+(right-left)/2;
    build(left,m,cur*2);
    build(m+1,right,cur*2+1);
    pushUp(cur);
}
void update(int p,int add,int left, int right, int cur)
{
    if(left==right)
      {
         tree[cur]+=add;
         return ;
      }
    int m=left+(right-left)/2;
    if(p<=m)
        update(p,add,left,m,cur*2);
    else
        update(p,add,m+1,right,cur*2+1);
    pushUp(cur);
}
int query(int ql,int qr,int curleft,int curright,int cur)
{
    if(ql<=curleft&&qr>=curright)
        return tree[cur];
    int m=curleft+(curright-curleft)/2;
    int sum=0;
    if(ql<=m)
        sum=query(ql,qr,curleft,m,cur*2);
    if(qr>m)
        sum+=query(ql,qr,m+1,curright,cur*2+1);
    return sum;
}
int main()
{
    scanf("%d",&T);
    int kas=1;
    while(T--)
    {
        printf("Case %d:\n",kas++);
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
            scanf("%d",&a[i]);
        build(1,n,1);
        string op;
        while(cin>>op)
        {
            if(op=="End")
                break;
            scanf("%d %d",&x,&y);
            if(op=="Add")
               update(x,y,1,n,1);
            if(op=="Sub")
                update(x,-y,1,n,1);
            if(op=="Query")
                printf("%d\n",query(x,y,1,n,1));
        }
    }
    return 0;
}