POJ 3468

区间加减、查询，有了区间修改的经验，这题还是比较顺利的。

#include <cstdio>
using namespace std;

#define recursive_def    int l, int r, int i
#define lsi            i<<1
#define rsi            lsi | 1
#define lso            l, m, lsi
#define rso            m+1, r, rsi
#define pushup        (v[i] = v[lsi] + v[rsi])
#define pushdown    if (dirty[i]) {
    dirty[lsi] += dirty[i], dirty[rsi] += dirty[i]; 
    v[lsi] += dirty[i] * (m-l+1);    
    v[rsi] += dirty[i] * (r-m);        
    dirty[i] = 0;}

#define MAXV    131072

long long _v[MAXV<<1], *const v = &_v[-1];
long long _dirty[MAXV << 1], *const dirty = &_dirty[-1];

void build(recursive_def)
{
    dirty[i] = 0;
    if (l == r) scanf("%lld", &v[i]);
    else {
        int m = l+r >> 1;
        build(lso), build(rso);
        pushup;
    }
}

int update(int L, int R, int val, recursive_def)
{
    if (L<=l && r<=R) v[i] += (r-l+1) * val, dirty[i] += val;
    else {
        int m = l+r >> 1;
        pushdown;
        if (L <= m) update(L, R, val, lso);
        if (m < R) update(L, R, val, rso);
        pushup;
    }
}

long long query(int L, int R, recursive_def)
{
    if (L<=l && r<=R) return v[i];
    int m = l+r >> 1;
    pushdown;
    long long result = 0;
    if (L <= m) result += query(L, R, lso);
    if (m < R) result += query(L, R, rso);
    return result;
}

int main(void)
{
//    freopen("poj3468.txt", "r", stdin);
    int N, Q;
    while(scanf("%d%d", &N, &Q) > 0) {
        build(1, N, 1);
        while(Q) {
            int L, R;
            char op[3];
            scanf("
%s", op);
            if (op[0] == 'Q') {
                scanf("%d%d", &L, &R);
                printf("%lld
", query(L, R, 1, N, 1));
            } else {
                int C;
                scanf("%d%d%d", &L, &R, &C);
                update(L, R, C, 1, N, 1);
            }
            --Q;
        }
    }
    return 0;
}

3468

Accepted

4464K

2641MS

G++

1625B

2014-06-08 17:04:33