POJ 3468 A Simple Problem with Integers

A Simple Problem with Integers

Time Limit:5000MS     Memory Limit:131072KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  POJ 3468

Description

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 abc" means adding c to each of A_a, A_a+1, ... , A_b. -10000 ≤ c ≤ 10000.
"Q ab" 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 <stdio.h>
#include <string.h>
#include <stdlib.h>
using namespace std;
#define N 100002
struct node
{
    int l,r;
    long long lz,w;
} q[4*N];
void pushup(int rt)
{
    q[rt].w=q[rt*2].w+q[rt*2+1].w;
}
void pushdown(int rt,int m)
{
    if(q[rt].lz)
    {
        q[rt*2].lz+=q[rt].lz;
        q[rt*2+1].lz+=q[rt].lz;
        q[rt*2].w+=(m-m/2)*q[rt].lz;
        q[rt*2+1].w+=(m/2)*q[rt].lz;
        q[rt].lz=0;
    }
}
void build(int l,int r,int rt)
{
    q[rt].l=l;
    q[rt].r=r;
    q[rt].lz=0;
    if(l==r)
    {
        scanf("%I64d",&q[rt].w);
        return ;
    }
    build(l,(r+l)/2,rt*2);
    build((r+l)/2+1,r,rt*2+1);
    pushup(rt);
}
void update(int key,int ll,int rr,int l,int r,int rt)
{
    if(ll>r || rr<l)
    {
        return ;
    }
    if(ll<=l&&rr>=r)
    {
        q[rt].w+=(long long)key*(r-l+1);
        q[rt].lz+=key;
        return ;
    }
    pushdown(rt,r-l+1);
    int m=(r+l)/2;
    if(ll<=m)
        update(key,ll,rr,l,m,rt*2);
    if(rr>m)
    {
        update(key,ll,rr,m+1,r,rt*2+1);
    }
    pushup(rt);
}
/*
long long query(int ll,int rr,int l,int r,int rt)
{
    if(ll<=l&&rr>=r)
    {
        return q[rt].w;
    }
    pushdown(rt,r-l+1);
    int m=(r+l)/2;
    long long L=0;
    if(ll<=m) L+=query(ll,rr,l,m,rt*2);
    if(rr>m) L+=query(ll,rr,m+1,r,rt*2+1);
    return L;
}
*/


long long query(int ll,int rr,int l,int r,int rt)
{
    if(rr<l || ll>r)
    {
        return 0;
    }
    if(ll<=l && rr>=r)
    {
        return q[rt].w;
    }

    pushdown(rt,r-l+1);
    int kk = (r+l)>>1;
    long long  ret = 0;
    return (query(ll,rr,l,kk,rt<<1)+query(ll,rr,kk+1,r,rt<<1|1));

}
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        build(1,n,1);
        while(m--)
        {
            char op[10];
            int a , b , c;
            scanf("%s",op);
            if (op[0] == 'Q')
            {
                scanf("%d%d",&a,&b);
                long long tt=query(a,b,1,n,1);
                printf("%I64d\n",tt);
            }
            else
            {
                scanf("%d%d%d",&a,&b,&c);
                update(c,a,b,1,n,1);
            }
        }
    }
    return 0;

}