HDU 1166 敌兵布阵【线段树 单点更新】

题意:给出n个数，a1,a2,a3,,,,,an,再给出一些操作

add i  j 表示给第i个节点增加j

sub i  j 表示给第i个节点减少j

query i j 表示询问第i个节点到第j个节点的和

套的别人的模板写的---还是要再多自己写写的说-------

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include <cmath>
 #include<stack>
 #include<vector>
 #include<map>
 #include<set>
 #include<queue>
 #include<algorithm>
 using namespace std;

 typedef long long LL;
 const int INF = (<<)-;
 const int mod=;
 const int maxn=;

 int a[maxn];

 struct node{
     int l,r;
     int s;
 };

 node tree[*maxn];

 int calc(int x,int y) { return x + y;}

 void build_tree(int i,int l,int r){
     if(l==r){
         tree[i].l=l;
         tree[i].r=r;
         tree[i].s=a[l];
         return;
     }
     int mid=(l+r)/;
     build_tree(*i,l,mid);
     build_tree(*i+,mid+,r);
     tree[i].l=l;
     tree[i].r=r;
     tree[i].s=calc(tree[*i].s,tree[*i+].s);
 }

 void update1(int i,int s,int w){
     if(tree[i].l==tree[i].r){
         tree[i].s+=w;
         return;
     }
     int mid=(tree[i].l + tree[i].r)/;
     if(s<=mid) update1(*i,s,w);
     else update1(*i+,s,w);

     tree[i].s=calc(tree[*i].s,tree[*i+].s);
 }

 void update2(int i,int s,int w){
     if(tree[i].l==tree[i].r){
         tree[i].s-=w;
         return;
     }
     int mid=(tree[i].l + tree[i].r)/;
     if(s<=mid) update2(*i,s,w);
     else update2(*i+,s,w);

     tree[i].s=calc(tree[*i].s,tree[*i+].s);
 }

 int sum(int i,int l,int r){
 //    printf("tree[%d].s=%d\n",i,tree[i].s);
     if(tree[i].l==l&&tree[i].r==r){
         return tree[i].s;
     }
     else{
         int mid=(tree[i].l+tree[i].r)/;
         if(r<=mid) return sum(*i,l,r);
         if(l>mid) return sum(*i+,l,r);

         return calc(sum(*i,l,mid),sum(*i+,mid+,r));
     }
 }

 int main(){
     int T;
     scanf("%d",&T);
     int kase=;
     while(T--){
         int n;
         scanf("%d",&n);
         for(int i=;i<=n;i++) scanf("%d",&a[i]);

         build_tree(,,n);

             char s[];
         int x,y;
         printf("Case %d:\n",++kase);

         while(scanf("%s",s)!=EOF){

             if(s[] == 'E') break;
             if(s[] == 'A'){
                 scanf("%d %d",&x,&y);
                 update1(,x,y);
             }
             if(s[]=='S'){
                 scanf("%d %d",&x,&y);
                 update2(,x,y);
             }
             if(s[] == 'Q'){
                 scanf("%d %d",&x,&y);
                 printf("%d\n",sum(,x,y));
             }
         }
     }
     return ;
 }