poj 3468 A Simple Problem with Integers

A Simple Problem with Integers

Time Limit: 5000MS		Memory Limit: 131072K
Total Submissions: 62855		Accepted: 19302
Case Time Limit: 2000MS

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.

你有n个整数，A₁, A₂, ... , A_{N。你需要处理两种操作。一个是在给定区间上面的数字上加上一个值。另一个是询问这个区间的和。}

Input

The first line contains two numbers N and Q. 1 ≤ N,Q ≤ 100000.

第一行包括两个数字N和Q。1 ≤ N,Q ≤ 100000.
The second line contains N numbers, the initial values of A₁, A₂, ... , A_N. -1000000000 ≤ A_i ≤ 1000000000.

第二行包括N个数字，初始化值为A₁, A₂, ... , A_N. -1000000000 ≤ A_i ≤ 1000000000.
Each of the next Q lines represents an operation.

接下来Q行，每行一个操作
"C a b c" means adding c to each of A_a, A_a+1, ... , A_b. -10000 ≤ c ≤ 10000.

"C a b c"表示在A_a, A_a+1, ... , A_{b上面加上C。-10000 ≤ c ≤ 10000.}
"Q a b" means querying the sum of A_a, A_a+1, ... , A_b.

"Q a b" 表示询问A_a, A_a+1, ... , A_b的和

Output

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

你需要回答所有的Q询问。一个答案占一行。

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.

Source

POJ Monthly--2007.11.25, Yang Yi

这也是一道区间更新的线段树基础题，因为很裸。。。适合用来做基础练习，然后就是普通的加，普通的询问，普通的输出。。。

这次跟上一道题的区别就是这个是在原有基础上增加，上一道是替换，所以写的时候要注意一下，然后就没什么了。。。注意数据长度会大于int

#include <stdio.h>
#include <string.h>
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

const int maxn = 111111;
__int64 col[maxn << 2];
__int64 sum[maxn << 2];
int q, n;

void PushUp(int rt){
    sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}

void build(int l, int r, int rt){
    int m;
    col[rt] = 0;
    if (l == r){
        scanf("%I64d", &sum[rt]);
        return;
    }
    m = (l + r) >> 1;
    build(lson);
    build(rson);
    PushUp(rt);
    return;
}

void PushDown(int rt, int m){
    if (col[rt]){
        col[rt << 1] +=  col[rt];
        col[rt << 1 | 1] += col[rt];
        sum[rt << 1] += (m - (m >> 1)) * col[rt];
        sum[rt << 1 | 1] += (m >> 1) * col[rt];
        col[rt] = 0;
    }
}

void update(int L, int R, int x, int l, int r, int rt){
    int m;
    if (L <= l && r <= R){
        col[rt] += x;
        sum[rt] += (__int64)x * (r - l + 1);
        return;
    }
    PushDown(rt, r - l + 1);
    m = (l + r) >> 1;
    if (L <= m) update(L, R, x, lson);
    if (R > m)  update(L, R, x, rson);
    PushUp(rt);
    return;
}

__int64 query(int L, int R, int l, int r, int rt){
    __int64 ret;
    int m;
    if (L <= l && r <= R){
        return sum[rt];
    }
    ret = 0;
    PushDown(rt, r - l + 1);
    m = (l + r) >> 1;
    if (L <= m)
        ret += query(L, R, lson);
    if (R > m)
        ret += query(L, R, rson);
    return ret;
}
int main(void){

    int i, l, r, x;
    char op[2];
    freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    scanf("%d%d", &n, &q);
    build(1, n, 1);
    for (i = 0;i < q;i ++){
        scanf("%s", op);
        if (op[0] == 'C'){
            scanf("%d%d%d", &l, &r, &x);
            update(l, r, x, 1, n, 1);
        }else if (op[0] == 'Q'){
            scanf("%d%d", &l, &r);
            printf("%I64d\n", query(l, r, 1, n, 1));
        }
    }
    return 0;
}