POJ3468 A Simple Problem with Integers

URL:http://poj.org/problem?id=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 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 <cstdio>

struct interval_tree{
    int nums[100010];
    struct Node{
        long long mark, sum;
    } node[100010 << 2];

    void build(int l, int r, int i) {
        if (l == r) {node[i].sum = nums[l]; return;}
        int mid = (l + r) >> 1;
        build(l, mid, i << 1);
        build(mid + 1, r, i << 1 | 1);
        node[i].sum = node[i << 1].sum + node[i << 1 | 1].sum;
    }

    void update(int l, int r, int i) {
        if (!node[i].mark) return;
        int mid = (l + r) >> 1;
        node[i << 1].sum += node[i].mark * (mid - l + 1);
        node[i << 1].mark += node[i].mark;
        node[i << 1 | 1].sum += node[i].mark * (r - mid);
        node[i << 1 | 1].mark += node[i].mark;
        node[i].mark = 0;
    }

    void add(int tl, int tr, int l, int r, int i, int val) {
        if (tr < l || tl > r) return;
        if (tl <= l && r <= tr) {
            node[i].sum += (long long)val * (r -l + 1);
            node[i].mark += val;
            return;
        }
        update(l, r, i);
        int mid = (l + r) >> 1;
        add(tl, tr, l, mid, i << 1, val);
        add(tl, tr, mid + 1, r, i << 1 | 1, val);
        node[i].sum = node[i << 1].sum + node[i << 1 | 1].sum;
    }

    long long query(int tl, int tr, int l, int r, int i) {
        if (tr < l || tl > r) return 0;
        if (tl <= l && r <= tr) return node[i].sum;
        update(l, r, i);
        int mid = (l + r) >> 1;
        return query(tl, tr, l, mid, i << 1) + query(tl, tr, mid + 1, r, i << 1 | 1);
    }

} tree;

int main(){
    int n, q;
    scanf("%d %d", &n, &q);
    for (int i = 1; i <= n; i++)
        scanf("%d", tree.nums + i );
    getchar();
    tree.build(1, n, 1);

    while(q--) {
        int tl, tr, val; char c;
        scanf("%c", &c);
        if(c == 'Q'){
            scanf("%d %d\n", &tl, &tr);
            printf("%lld\n", tree.query(tl, tr, 1, n, 1));
        }
        else{
            scanf("%d %d %d\n", &tl, &tr, &val);
            tree.add(tl, tr, 1, n, 1, val);
        }
    }

    return 0;
}