HDU 1166 敌兵布阵 线段树区间求和 更改

水

 #include<iostream>
 #include<string>
 #include<algorithm>
 #include<cstdlib>
 #include<cstdio>
 #include<set>
 #include<map>
 #include<vector>
 #include<cstring>
 #include<stack>
 #include<cmath>
 #include<queue>
 #include <bits/stdc++.h>
 using namespace std;
 #define INF 0x3f3f3f3f
 #define ll long long
 #define clc(a,b) memset(a,b,sizeof(a))
 const int maxn=;

 int ans;
 struct  node
 {
     int left,right,sum;
     int mid()
     {
         return (left+right)>>;
     }
 }tree[maxn*];

 void build_tree(int l,int r,int o)
 {
     tree[o].left=l;
     tree[o].right=r;
     if(l==r)
     {
         scanf("%d",&tree[o].sum);
         return ;
     }
     int mid=tree[o].mid();
     build_tree(l,mid,o<<);
     build_tree(mid+,r,o<<|);
     tree[o].sum=tree[o<<].sum+tree[o<<|].sum;
 }

 void query(int l,int r,int o,int L,int R)
 {
     if(L<=l&&r<=R)
     {
         ans+=tree[o].sum;
         return ;
     }
     int mid=tree[o].mid();
     if(R<=mid)
      query(l,mid,o<<,L,R);
     else if(L>mid)
         query(mid+,r,o<<|,L,R);
     else
     {
         query(l,mid,o<<,L,R);
         query(mid+,r,o<<|,L,R);
     }
 }

 void update(int l,int r,int o,int pos,int add)
 {
     if(l==r)
     {
        tree[o].sum+=add;
        return ;
     }
     int mid=tree[o].mid();
     if(pos<=mid)
     {
         update(l,mid,o<<,pos,add);
     }
     else
         update(mid+,r,o<<|,pos,add);
     tree[o].sum=tree[o<<].sum+tree[o<<|].sum;
 }

 int main()
 {
     int t,n,cnt;
     int a,b;
     char str[];
     cnt=;
     scanf("%d",&t);
     while(t--)
     {
         scanf("%d",&n);
         build_tree(,n,);
         printf("Case %d:\n",cnt++);
         while(scanf("%s",str))
         {
             if(str[]=='E')
                 break;
             scanf("%d%d",&a,&b);
             if(str[]=='Q')
             {
                 ans=;
                 query(,n,,a,b);
                 printf("%d\n",ans);
             }
             else if(str[]=='A')
             update(,n,,a,b);
             else
                 update(,n,,a,-b);
         }
     }
     return ;
 }