POJ 3468 A Simple Problem with Integers----线段树

Time Limit: 5000MS		Memory Limit: 131072K
Total Submissions: 138240		Accepted: 42813
Case Time Limit: 2000MS

Description

You have N integers, A1, A2, ... , AN. 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 A1, A2, ... , AN. -1000000000 ≤ Ai ≤ 1000000000.
Each of the next Q lines represents an operation.
"C a b c" means adding c to each of Aa, Aa+1, ... , Ab. -10000 ≤ c ≤ 10000.
"Q a b" means querying the sum of Aa, Aa+1, ... , Ab.

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.

题意：对[1,n]区间进行区间修改和区间查询。简单的线段树套用模板问题。

#include <iostream>
#include <stdio.h>
#include <string.h>
#define ll long long
#define maxn 100000+5
using namespace std;
ll sum[maxn<<2],Add[maxn<<2];
void pushup(int rt)
{
    sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
void build(int l,int r,int rt)
{
    if(l==r){
        scanf("%lld",&sum[rt]);
        return ;
    }
    int m=(l+r)>>1;
    build(l,m,rt<<1);
    build(m+1,r,rt<<1|1);
    pushup(rt);
}
void pushdown(int rt,int ln,int rn)
{
    if(Add[rt]){
        Add[rt<<1]+=Add[rt];
        Add[rt<<1|1]+=Add[rt];
        sum[rt<<1]+=Add[rt]*ln;
        sum[rt<<1|1]+=Add[rt]*rn;
        Add[rt]=0;
    }
}

void updata(int L,int R,int C,int l,int r,int rt)
{
    if(L<=l&&r<=R){
        sum[rt]+=C*(r-l+1);
        Add[rt]+=C;
        return ;
    }
    int m=(l+r)>>1;
    pushdown(rt,m-l+1,r-m);
    if(L<=m)updata(L,R,C,l,m,rt<<1);
    if(R>m)updata(L,R,C,m+1,r,rt<<1|1);
    pushup(rt);
}
ll query(int L,int R,int l,int r,int rt)
{
    if(L<=l&&r<=R)return sum[rt];
    int m=(l+r)>>1;
    pushdown(rt,m-l+1,r-m);
    ll ans=0;
    if(L<=m)ans+=query(L,R,l,m,rt<<1);
    if(R>m)ans+=query(L,R,m+1,r,rt<<1|1);
    return ans;
}
int main()
{

    int n,q,x,y,d;
    scanf("%d%d",&n,&q);
    char a;
    build(1,n,1);
    getchar();
    for(int i=0;i<q;i++)
    {
        scanf("%c",&a);
        if(a=='Q'){
                scanf("%d%d",&x,&y);
        printf("%lld\n",query(x,y,1,n,1));
        }
        if(a=='C'){
                scanf("%d%d%d",&x,&y,&d);
        updata(x,y,d,1,n,1);
        }
        getchar();
    }
    return 0;
}