hihoCoder 1080 更为复杂的买卖房屋姿势（区间更新）

更为复杂的买卖房屋姿势

AC代码：

#include <iostream>
#include <cstdio>
using namespace std;

const int N = 100005;
struct node{
    int l,r,sum;
    int add,setv;
}tree[N<<2];
int a[N];
int ans;

void build(int id,int l,int r){
    tree[id].l = l;
    tree[id].r = r;
    tree[id].setv = 0;
    tree[id].add = 0;
    if(l == r){
        tree[id].sum = a[l];
        return;
    }
    int mid = (l+r)>>1;
    build(id<<1,l,mid);
    build(id<<1|1,mid+1,r);
    tree[id].sum = tree[id<<1].sum + tree[id<<1|1].sum;
}

void pushdown(int id){
    if(tree[id].setv){
        int tmp = tree[id].setv;
        tree[id<<1].setv = tree[id<<1|1].setv = tmp;
        tree[id<<1].add = tree[id<<1|1].add = 0;
        tree[id<<1].sum = (tree[id<<1].r-tree[id<<1].l+1)*tmp;
        tree[id<<1|1].sum = (tree[id<<1|1].r-tree[id<<1|1].l+1)*tmp;
        tree[id].setv = 0;
    }
    if(tree[id].add){
        int tmp = tree[id].add;
        tree[id<<1].add += tmp;tree[id<<1|1].add += tmp;
        tree[id<<1].sum += (tree[id<<1].r-tree[id<<1].l+1)*tmp;
        tree[id<<1|1].sum += (tree[id<<1|1].r-tree[id<<1|1].l+1)*tmp;
        tree[id].add = 0;
    }
}

void updateSet(int id,int l,int r,int val){
    if(tree[id].l >= l && tree[id].r <= r){
        tree[id].setv = val;
        tree[id].sum = (tree[id].r-tree[id].l+1)*val;
        tree[id].add = 0;
        return;
    }
    pushdown(id);
    int mid = (tree[id].l+tree[id].r)>>1;
    if(l <= mid)
        updateSet(id<<1,l,r,val);
    if(mid < r)
        updateSet(id<<1|1,l,r,val);
    tree[id].sum = tree[id<<1].sum + tree[id<<1|1].sum;
}

void updateAdd(int id,int l,int r,int val){
    if(tree[id].l >= l && tree[id].r <= r){
        tree[id].add += val;
        tree[id].sum += (tree[id].r-tree[id].l+1)*val;
        return;
    }
    pushdown(id);
    int mid = (tree[id].l+tree[id].r)>>1;
    if(l <= mid)
        updateAdd(id<<1,l,r,val);
    if(mid < r)
        updateAdd(id<<1|1,l,r,val);
    tree[id].sum = tree[id<<1].sum + tree[id<<1|1].sum;
}

void query(int id,int l,int r){
    if(tree[id].l >= l && tree[id].r <= r){
        ans += tree[id].sum;
        return;
    }
    pushdown(id);
    int mid = (tree[id].l+tree[id].r)>>1;
    if(l <= mid)
        query(id<<1,l,r);
    if(mid < r)
        query(id<<1|1,l,r);
    tree[id].sum = tree[id<<1].sum + tree[id<<1|1].sum;
}

int main(){
    int n,m;
    while(~scanf("%d%d",&n,&m)){
        for(int i = 0; i <= n; i++)
            scanf("%d",&a[i]);
        build(1,0,n);
        while(m--){
            int op,a,b,c;
            scanf("%d%d%d%d",&op,&a,&b,&c);
            if(op == 0){
                ans = 0;
                updateAdd(1,a,b,c);
                query(1,0,n);
                printf("%d\n",ans);
            }
            else{
                ans = 0;
                updateSet(1,a,b,c);
                query(1,0,n);
                printf("%d\n",ans);
            }
        }
    }
    return 0;
}