A Simple Problem with Integers POJ

A Simple Problem with Integers  POJ - 3468 

You have N integers, A₁, A₂, ... , A_N. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the sum of numbers in a given interval.

Input

The first line contains two numbers N and Q. 1 ≤ N,Q ≤ 100000.
The second line contains N numbers, the initial values of A₁, A₂, ... , A_N. -1000000000 ≤ A_i ≤ 1000000000.
Each of the next Q lines represents an operation.
"C a b c" means adding c to each of A_a, A_a+1, ... , A_b. -10000 ≤ c ≤ 10000.
"Q a b" means querying the sum of A_a, A_a+1, ... , A_b.

Output

You need to answer all Q commands in order. One answer in a line.

Sample Input

10 5
1 2 3 4 5 6 7 8 9 10
Q 4 4
Q 1 10
Q 2 4
C 3 6 3
Q 2 4

Sample Output

4
55
9
15

Hint

The sums may exceed the range of 32-bit integers.

 

#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <iomanip>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mem(sum,x) memset(sum,x,sizeof(sum))
#define rep(i,start,end) for(int i=start;i<=end;i++)
#define per(i,end,start) for(int i=end;i>=start;i--)
#define tle ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
const int mod = 998244353;
const int mxn = 2e5 +7;
int _,n,m,k,t,u,v,w,ans,cnt,ok;
int num[mxn] , last[mxn] , key[mxn] ;
/// string str ;
char str[10] , ch ;
#define lc now<<1
#define rc now<<1|1
struct node {ll val , l , r , sum , lazy ;};node no[mxn<<4];
int lowbit(int x) {return x&-x;};
/// void add(int i,int val){while(i<=n*4) key[i]+=val , i+=lowbit(i) ;}
/// int ask(int x){int ans = 0 ;while(x>0) ans+=key[x] , x-=lowbit(x) ;return ans;}
void pushup(int now){
    no[now].val = no[lc].val + no[rc].val ;
}
void updown(int now)
{
    /// no[now].val = no[lc].val + no[rc].val;
    /// no[now].val = max( no[lc].val , no[rc].val );
    if(no[now].lazy)
    {
        no[lc].lazy += no[now].lazy;
        no[rc].lazy += no[now].lazy;
        no[lc].val += (no[lc].r-no[lc].l+1)*no[now].lazy;
        no[rc].val += (no[rc].r-no[rc].l+1)*no[now].lazy;
        no[now].lazy = 0;
    }
}
void build(int l,int r,int now)
{
    no[now].l = l, no[now].r = r ,no[now].lazy = 0 ,no[now].val = 0 ;
    if(l==r){
        cin>>no[now].val;return ;
    }
    int mid = (l+r)>>1;
    build(l,mid,lc); build(mid+1,r,rc); pushup(now) ;
}
ll ask(int l,int r,int now)
{
    if(l<=no[now].l && r>=no[now].r){
        return no[now].val;
    }
    updown(now);
    int mid = (no[now].l+no[now].r)>>1;
    ll ans = 0 ;
    if(l<=mid) ans+=ask(l,r,lc);
    if(r>mid) ans+=ask(l,r,rc);
    return ans ;
}
void add(int l,int r,int val,int now)
{
    if(l<=no[now].l && no[now].r<=r){
        no[now].lazy += val ;
        no[now].val += (no[now].r-no[now].l+1)*val;
        return ;
    }
    updown(now);
    int mid = (no[now].l+no[now].r)>>1;
    if(l<=mid) add(l,r,val,lc);
    if(r>mid) add(l,r,val,rc);
    pushup(now);
}
int main()
{
    tle;
    while(cin>>n>>m)
    {
        build(1,n,1);
        while(m--)
        {
            int u,v;
            cin>>ch>>u>>v;
            if(ch=='Q') cout<<ask(u,v,1)<<endl;
            else {
            cin>>k; add(u,v,k,1);
            }
        }
    }
}