poj 3468 一维树桩数组区间更新区间查询

http://poj.org/problem?id=3468

#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<set>
const int MAXN=1e6+10;
using namespace std;
int lowbit(int x){return x&(-x);}
int n,Q,x,y;
long long A[MAXN],C[MAXN],sum[MAXN],z;
void modifyA(int x,int val){
    while(x<=n){
        A[x]+=val;
        x+=lowbit(x);
    }
}
void modifyC(int x,long long val){
    while(x<=n){
        C[x]+=val;
        x+=lowbit(x);
    }
}
void update(int from,int to,long long val){
    modifyA(from,val);
    modifyA(to+1,-val);
    modifyC(from,val*from);
    modifyC(to+1,-val*(to+1));
}
long long queryA(int loc){
    long long ans=0;
    while(loc){
        ans+=A[loc];
        loc-=lowbit(loc);
    }
    return ans;
}
long long queryC(int loc){
    long long ans=0;
    while(loc){
        ans+=C[loc];
        loc-=lowbit(loc);
    }
    return ans;
}
long long query(int loc)
 {
    return sum[loc]+(loc+1)*queryA(loc)-queryC(loc);
}
long long query(int from,int to)
{
    return query(to)-query(from-1);
}
int m;
int main()
{
    string opt;
    scanf("%d%d",&n,&m);
    for(register int i=1;i<=n;i++)scanf("%lld",&sum[i]),sum[i]+=sum[i-1];
    while(m--){
            cin>>opt;
        scanf("%d%d",&x,&y);
        if(opt=="C")
        {
            scanf("%lld",&z);
            update(x,y,z);
        }
        else
        {
            printf("%lld\n",query(x,y));
        }
    }
}