POJ3468 A Simple Problem with Integers（线段树）

题目链接：poj3468

思路

区间更新：区间加上某个数
区间查询：区间和

小结

1A了。。

代码

#include <iostream>
#include <cstring>
#include <cstdio>

using namespace std;

typedef long long ll;

const int maxn = 100000+5;
ll tree[maxn<<2];
ll add[maxn<<2];

void build(int rt, int l, int r){
    if(l==r){
        scanf("%lld", &tree[rt]);
    }
    else{
        int mid = (l+r)>>1;
        build(rt<<1, l, mid);
        build(rt<<1|1, mid+1, r);
        tree[rt] = tree[rt<<1] + tree[rt<<1|1];
    }
}

void pushdown(int rt, int len){
    if(add[rt]!=0){ 
        add[rt<<1] += add[rt];
        add[rt<<1|1] += add[rt];
        tree[rt<<1] += (len - len/2) * add[rt];
        tree[rt<<1|1] += (len/2) * add[rt];
        add[rt] = 0;
    }
} 

void Add(int rt, int a, int b, int l, int r, ll x){
    if(a<=l && r<=b){
        add[rt] += x;
        tree[rt] += (ll)(x * (r-l+1));
    }
    else{
        pushdown(rt, r-l+1);
        int mid = (l+r)>>1;
        if(a<=mid) Add(rt<<1, a, b, l, mid, x);
        if(mid<b) Add(rt<<1|1, a, b, mid+1, r, x);
        tree[rt] = tree[rt<<1] + tree[rt<<1|1];
    }
}

ll query(int rt, int a, int b, int l, int r){
    if(a<=l && r<=b){
        return tree[rt];
    }
    else{
        pushdown(rt, r-l+1);
        int mid = (l+r)>>1;
        ll ans = 0;
        if(a<=mid) ans += query(rt<<1, a, b, l, mid);
        if(mid<b) ans += query(rt<<1|1, a, b, mid+1, r);
        return ans;
    }
}

int main(){
    ll c;
    int n, q, a, b;
    char opt[10];
    while(scanf("%d%d", &n, &q)!=EOF){
        memset(add, 0, sizeof(add));
        build(1, 1, n);
        for(int i=0; i<q; ++i){
            scanf("%s%d%d", opt, &a, &b);
            if(opt[0]=='Q'){
                printf("%lld\n", query(1, a, b, 1, n));
            }
            else if(opt[0]=='C'){
                scanf("%lld", &c);
                Add(1, a, b, 1, n, c);
            }
        }
    }
    return 0;
}