线段树 区间查询区间修改 poj 3468

 #include<cstdio>
 #include<iostream>
 #include<algorithm>
 #include<string.h>
 using namespace std;
 typedef long long ll;
 const ll maxn=1e5+;
 ll ary[maxn];
 struct node
 {
     ll l,r,val;
     ll add;
 }tree[maxn<<];
 void pushup(ll cur)
 {
     tree[cur].val=tree[cur<<].val+tree[cur<<|].val;
 }
 void down(ll cur,ll len)
 {
     if(tree[cur].add){
         tree[cur<<].val+=(len-(len>>))*tree[cur].add;
         tree[cur<<|].val+=(len>>)*tree[cur].add;
         tree[cur<<].add+=tree[cur].add;
         tree[cur<<|].add+=tree[cur].add;
         tree[cur].add=;
     }
 }
 void build(ll l,ll r,ll cur)
 {
     tree[cur].l=l,tree[cur].r=r;
     tree[cur].val=tree[cur].add=;
     if(l==r){
         tree[cur].val=ary[l];
         return;
     }
     ll mid=(l+r)/;
     build(l,mid,cur<<);
     build(mid+,r,cur<<|);
     pushup(cur);
 }
 ll query(ll l,ll r,ll cur)
 {
     ll L=tree[cur].l,R=tree[cur].r;
     if(l<=L&&r>=R) return tree[cur].val;
     down(cur,R-L+);
     ll mid=(L+R)/;
     ll ans=;
     if(l<=mid) ans+=query(l,r,cur<<);
     if(r>mid)  ans+=query(l,r,cur<<|);
     return ans;
 }
 void update(ll l,ll r,ll key,ll cur)
 {
     ll L=tree[cur].l,R=tree[cur].r;
     if(l<=L&&r>=R){
         tree[cur].val+=(R-L+)*key;
         tree[cur].add+=key;
         return;
     }
     down(cur,R-L+);
     ll mid=(L+R)/;
     if(l<=mid) update(l,r,key,cur<<);
     if(r>mid)  update(l,r,key,cur<<|);
     pushup(cur);
 }
 int main()
 {
     ll n,m;
     scanf("%lld%lld",&n,&m);
     for(ll i=;i<=n;i++)
         scanf("%lld",&ary[i]);
     build(,n,);
     while(m--){
         char tmp;
         cin>>tmp;
         if(tmp=='Q'){
             ll l,r;
             scanf("%lld%lld",&l,&r);
             ll ans=query(l,r,);
             printf("%lld\n",ans);
         }
         else{
             ll l,r,key;
             scanf("%lld%lld%lld",&l,&r,&key);
             update(l,r,key,);
         }
     }
     return ;
 }