A Simple Problem with Integers

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

线段树区间修改，区间查询 

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

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=1e5+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return ans;
}

struct node
{
    int l,r;
    ll val,lazy;
}tree[maxn*4];
int n,q;
void push(int rt)
{
    if(tree[rt].lazy)
    {
        tree[rt<<1].val+=(tree[rt<<1].r-tree[rt<<1].l+1)*tree[rt].lazy;
        tree[rt<<1|1].val+=(tree[rt<<1|1].r-tree[rt<<1|1].l+1)*tree[rt].lazy;
        tree[rt<<1].lazy+=tree[rt].lazy;
        tree[rt<<1|1].lazy+=tree[rt].lazy;
        tree[rt].lazy=0;
    }
}
void build(int le,int ri,int rt)
{
    tree[rt].l=le;
    tree[rt].r=ri;
    tree[rt].lazy=0;
    if(le==ri)
    {
        scanf("%lld",&tree[rt].val);
        return ;
    }
    int mid=(le+ri)>>1;
    build(le,mid,rt<<1);
    build(mid+1,ri,rt<<1|1);
    tree[rt].val=tree[rt<<1].val+tree[rt<<1|1].val;
}
void update(int x,int y,int le,int ri,int rt,int val)
{
    if(x<=le&&y>=ri)
    {
        tree[rt].val+=(tree[rt].r-tree[rt].l+1)*val;
        tree[rt].lazy+=val;
        return ;
    }
    int mid=(le+ri)>>1;
    push(rt);
    if(x<=mid)
    {
        update(x,y,le,mid,rt<<1,val);
    }
    if(y>mid)
    {
        update(x,y,mid+1,ri,rt<<1|1,val);
    }
    tree[rt].val=tree[rt<<1].val+tree[rt<<1|1].val;
}
ll query(int x,int y,int le,int ri,int rt)
{
    if(x<=le&&y>=ri) return tree[rt].val;
    int mid=(le+ri)>>1;
    push(rt);
    ll ans=0;
    if(x<=mid)
    {
        ans+=query(x,y,le,mid,rt<<1);
    }
    if(y>mid)
    {
        ans+=query(x,y,mid+1,ri,rt<<1|1);
    }
    return ans;
}
int main()
{
    //freopen("input.txt", "r", stdin);
    //FASTIO;
    while(~scanf("%d%d",&n,&q))
    {
        build(1,n,1);
        while(q--)
        {
            char c;
            int x,y,val;
            getchar();
            scanf("%c",&c);
            if(c=='C')
            {
                scanf("%d%d%d",&x,&y,&val);
                update(x,y,1,n,1,val);
            }
            else
            {
                scanf("%d%d",&x,&y);
                printf("%lld\n",query(x,y,1,n,1));
            }
        }
    }

    return 0;
}