cdoj1057 秋实大哥与花 线段树 区间加，区间查询和

题目链接:

http://acm.uestc.edu.cn/#/problem/show/1057

题意:

题解:

代码:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MS(a) memset(a,0,sizeof(a))
#define MP make_pair
#define PB push_back
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
//////////////////////////////////////////////////////////////////////////
const int maxn = 1e5+10;

int n,a[maxn],q;

struct node{
    int l,r;
    ll sum,lazy;
    void update(ll x){
        sum += 1LL * (r-l+1)*x;
        lazy += x;
    }
}tree[maxn<<2];

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

void pushdown(int rt){
    int lazyval = tree[rt].lazy;
    if(lazyval){
        tree[rt<<1].update(lazyval);
        tree[rt<<1|1].update(lazyval);
        tree[rt].lazy = 0;
    }
}


void build(int rt,int l,int r){
    tree[rt].l = l,tree[rt].r = r;
    tree[rt].sum = tree[rt].lazy = 0;
    if(l == r){
        tree[rt].sum = a[l];
    }else{
        int mid = (l+r)/2;
        build(rt<<1,l,mid);
        build(rt<<1|1,mid+1,r);
        pushup(rt);
    }
}

void update(int rt, int l,int r,ll val){
    int L = tree[rt].l, R = tree[rt].r;
    if(l<=L && R<=r){
        tree[rt].update(val);
    }else{
        pushdown(rt);
        int mid = (L+R) / 2;
        if(mid >= l) update(rt<<1,l,r,val);
        if(r > mid) update(rt<<1|1,l,r,val);
        pushup(rt);
    }
}

ll query(int rt,int l,int r){
    int L = tree[rt].l, R = tree[rt].r;
    if(l<=L && R<=r){
        return tree[rt].sum;
    }else{
        pushdown(rt);
        ll ans = 0;
        int mid = (L+R) / 2;
        if(mid >= l) ans += query(rt<<1,l,r);
        if(r > mid) ans += query(rt<<1|1,l,r);
        pushup(rt);
        return ans;
    }
}

int main(){
    n = read();
    for(int i=1; i<=n; i++)
        a[i] = read();
    build(1,1,n);
    q = read();
    for(int i=1; i<=q; i++){
        int l,r,val;
        scanf("%d%d%d",&l,&r,&val);
        update(1,l,r,val);
        printf("%I64d\n",query(1,l,r));
    }

    return 0;
}