hdu1166排兵布阵

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define MAX 2000100
int a[50010];
using namespace std;
struct Node//构建结点
{
    int l;
    int r;
    int value;
   // int add;
}tree[MAX];


void build(int v,int l,int r)建树
{
    tree[v].l=l;
    tree[v].r=r;
    tree[v].value=0;
    if(l==r)
    {
        tree[v].value=a[l];
        return;
    }
    int mid=(l+r)/2;
    build(2*v,l,mid);
    build(2*v+1,mid+1,r);
    tree[v].value=tree[2*v].value+tree[2*v+1].value;
}

void update(int v,int id,int k)///更新
{
    if(tree[v].l==tree[v].r)
    {
         tree[v].value=tree[v].value+k;
         return ;
    }
tree[v].value=tree[v].value+k;
    int mid=(tree[v].l+tree[v].r)/2;
    if(id<=mid)
        update(2*v,id,k);
    else
        update(2*v+1,id,k);
}

//int ans;
int query(int v,int l,int r)//查询
{
    if(tree[v].l==l&&tree[v].r==r)
    return tree[v].value;
  int  mid=(tree[v].l+tree[v].r)/2;
    if(r<=mid)
       return query(2*v,l,r);
    else if(l>mid)
       return query(2*v+1,l,r);
    else
        return query(2*v,l,mid)+query(2*v+1,mid+1,r);
}

int main()
{
    int t,n,st,ed,cnt;
    char c[10];
    scanf("%d",&t);
    cnt=1;
    while(t--)
    {
        printf("Case %d:\n",cnt++);
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
            scanf("%d",&a[i]);
        build(1,1,n);

        while(1)
        {
            scanf("%s",c);
            if(strcmp(c,"End")==0)
                break;
            scanf("%d%d",&st,&ed);

            if(strcmp(c,"Query")==0)
                printf("%d\n",query(1,st,ed));

            if(strcmp(c,"Add")==0)
                update(1,st,ed);

            if(strcmp(c,"Sub")==0)
                update(1,st,-ed);
         }
}
       return 0;
}