hdu 1166 线段树单点更新

等线段树复习完再做个总结

1
10
1 2 3 4 5 6 7 8 9 10
Query 1 3
Add 3 6
Query 2 7
Sub 10 2
Add 6 3
Query 3 10
End

Case 1:
6
33
59

2015-05-15:

 #include<cstdio>
 #include<iostream>
 #include<algorithm>
 #include<cstring>
 #include<cmath>
 #include<queue>
 #include<map>
 using namespace std;
 #define MOD 1000000007
 const int INF=0x3f3f3f3f;
 const double eps=1e-;
 #define cl(a) memset(a,0,sizeof(a))
 #define ts printf("*****\n");
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define root 1,n,1
 #define mid ((l+r)>>1)
 const int MAXN=;
 int n,m,t;
 int num[MAXN];
 struct Node
 {
     int l,r;
     int sum;
 }node[MAXN<<];
 void build(int l,int r,int rt)
 {
     node[rt].l=l;
     node[rt].r=r;
     if(l==r)
     {
         node[rt].sum=num[l];
         return;
     }
     build(lson);
     build(rson);
     node[rt].sum=node[rt<<|].sum+node[rt<<].sum;
 }
 void update(int p,int val,int l,int r,int rt)
 {
     if(l==r)
     {
         node[rt].sum+=val;
         return;
     }
     if(p<=mid)    update(p,val,lson);
     else  update(p,val,rson);
     node[rt].sum=node[rt<<|].sum+node[rt<<].sum;
 }
 int query(int L,int R,int l,int r,int rt)
 {
     if(l>=L&&r<=R)
     {
         return node[rt].sum;
     }
     int ret=;
     if(L<=mid)  ret+=query(L,R,lson);
     if(R>mid)   ret+=query(L,R,rson);
     return ret;
 }
 int main()
 {
     int i,j,k,tt;
     #ifndef ONLINE_JUDGE
     freopen("1.in","r",stdin);
     #endif
     scanf("%d",&tt);
     int ca=;
     while(tt--)
     {
         scanf("%d",&n);
         for(i=;i<=n;i++)
         {
             scanf("%d",num+i);
         }
         build(root);
         char s[];
         int l,r,po,v;
         printf("Case %d:\n",ca++);
         while(scanf("%s",s))
         {
             if(s[]=='E')   break;
             if(s[]=='Q')
             {
                 scanf("%d%d",&l,&r);
                 printf("%d\n",query(l,r,root));
             }
             if(s[]=='S')
             {
                 scanf("%d%d",&po,&v);
                 update(po,-v,root);
             }
             if(s[]=='A')
             {
                 scanf("%d%d",&po,&v);
                 update(po,v,root);
             }
         }
     }

 }

 #include<cstdio>
 #include<iostream>
 #include<algorithm>
 #include<cstring>
 #include<cmath>
 #include<queue>
 #include<map>
 using namespace std;
 #define MOD 1000000007
 const int INF=0x3f3f3f3f;
 const double eps=1e-;
 #define cl(a) memset(a,0,sizeof(a))
 #define ts printf("*****\n");
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define root 1,n,1
 #define mid ((l+r)>>1)
 const int MAXN=;
 int n,m,t;
 int sum[MAXN<<];
 void pushup(int rt)
 {
     sum[rt]=sum[rt<<]+sum[rt<<|];
 }
 void build(int l,int r,int rt)
 {
     if(l==r)
     {
         scanf("%d",&sum[rt]);
         return;
     }
     build(lson);
     build(rson);
     pushup(rt);
 }
 void update(int pos,int val,int l,int r,int rt)
 {
     if(l==r)
     {
         sum[rt]+=val;
         return;
     }
     if(pos<=mid)    update(pos,val,lson);
     else update(pos,val,rson);
     pushup(rt);
 }
 int query(int L,int R,int l,int r,int rt)
 {
     if(l>=L&&r<=R)
     {
         return sum[rt];
     }
     int ans=;
     if(L<=mid)  ans+=query(L,R,lson);
     if(R>mid)   ans+=query(L,R,rson);
     return ans;
 }
 int main()
 {
     int i,j,k,tt;
     #ifndef ONLINE_JUDGE
     freopen("1.in","r",stdin);
     #endif
     scanf("%d",&tt);
     int ca=;
     while(tt--)
     {
         scanf("%d",&n);
         printf("Case %d:\n",ca++);
         build(root);
         char s[];
         int p,v;
         while()
         {
             scanf("%s",s);
             if(s[]=='E')    break;
             scanf("%d%d",&p,&v);
             if(s[]=='A')   update(p,v,,n,);
             else if(s[]=='S')   update(p,-v,,n,);
             else if(s[]=='Q')  printf("%d\n",query(p,v,,n,));
         }
     }
 }

2015/7/21