【线段树】hdu1166 敌兵布阵 （单点修改区间查询模板）

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
const ll mod=1000000007;
const int maxn=5e4+10;
const int inf=0x3f3f3f3f;
const double eps=1e-6;
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
int t,n,m,a,b;
int sum[maxn<<2];
string s;
void push_up(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 mid =(l+r)>>1;
   build(lson);
   build(rson);
   push_up(rt);
}
void update(int p,int add,int l,int r,int rt){
   if(l==r){
      sum[rt]+=add;
      return;
   }
   int mid=(l+r)>>1;
   if(p<=mid) update(p,add,lson);
   else update(p,add,rson);
   push_up(rt);
}
int query(int a,int b,int l,int r,int rt){
   if(a<=l && b>=r) return sum[rt];
   int mid = (l+r)>>1;
   int ans=0;
   if(a<=mid) ans+=query(a,b,lson);
   if(b>mid) ans+=query(a,b,rson);
   return ans;
}

int main(){
   cin>>t;
   for(int i=1;i<=t;i++){
      printf("Case %d:\n",i);
      scanf("%d",&n);
      build(1,n,1);
      while(cin>>s){
         if(s=="End") break;
         scanf("%d%d",&a,&b);
         if(s=="Query"){
            printf("%d\n",query(a,b,1,n,1));
         }else if(s=="Add"){
            update(a,b,1,n,1);
         }else update(a,-b,1,n,1);
      }
   }

   
   return 0;
}