[POJ3468]A Simple Problem with Integers

题目地址：http://poj.org/problem?id=3468

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<utility>
using namespace std;

#define lson l , mid , rt << 1
#define rson mid + 1 , r , rt << 1 | 1
#define LL long long

const int maxn = 110000;
LL sum[maxn << 2], add[maxn << 2];



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

void PushDown(int rt, int len)
{
    add[rt << 1] += add[rt];
    add[rt << 1 | 1] += add[rt];
    sum[rt << 1] += (LL)add[rt] * (len - (len >> 1));
    sum[rt << 1 | 1] += (LL)add[rt] * (len >> 1);
    add[rt] = 0;
}

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

void update(int L, int R, int c, int l, int r, int rt)
{
    if (L <= l && R >= r)
    {
        add[rt] += c;
        sum[rt] += (LL)c * (r - l + 1);
        return;
    }
    PushDown(rt, r - l + 1);
    int mid = (l + r) >> 1;
    if (L <= mid) update(L, R, c, lson);
    if (R > mid) update(L, R, c, rson);
    PushUp(rt);
}

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

int main()
{
    int n, q;
    cin >> n >> q;
    build(1, n, 1);
    while (q--)
    {
        getchar();
        char ch;
        scanf("%c", &ch);
        if (ch == 'Q')
        {
            int a, b;
            scanf("%d%d", &a, &b);
            LL k = query(a, b, 1, n, 1);
            cout << k << endl;
        }
        else
        {
            int a, b, c;
            scanf("%d%d%d", &a, &b, &c);
            update(a, b, c, 1, n, 1);
        }
    }
}