HihoCoder - 1080 更为复杂的买卖房屋姿势 （线段树）

#include <iostream>
#include <cstdio>
using namespace std;
  //线段树区间更新模板
  //不写注释的模板都是傻，1年后保证自己看不懂
const int N = 100005;
struct node{
    int l,r,sum;
    int add,setv;
}tree[N<<2];
int a[N];
int ans;
void build(int root,int l,int r)
{
tree[root].l=l;
tree[root].r=r;
int mid=(l+r)>>1;
tree[root].setv = 0;
tree[root].add = 0;
if(l==r){scanf("%d",&tree[root].sum);return;}
build(root<<1,l,mid);
build(root<<1|1,mid+1,r);
tree[root].sum=tree[root<<1].sum+tree[root<<1|1].sum;
}
void pushdown(int root)//向下更新，每次查询到这个节点被标记了，就向下更新把他的儿子节点更新为标记
{
     if(tree[root].setv)
     {
          int tmp = tree[root].setv;
          tree[root<<1].setv=tree[root<<1|1].setv=tree[root].setv;
          tree[root<<1].add=tree[root<<1|1].add=0;
          tree[root<<1].sum=(tree[root<<1].r-tree[root<<1].l+1)*tmp;
          tree[root<<1|1].sum=(tree[root<<1|1].r-tree[root<<1|1].l+1)*tmp;
           tree[root].setv = 0;
     }
     if(tree[root].add){
        int tmp = tree[root].add;
        tree[root<<1].add += tmp;tree[root<<1|1].add += tmp;
        tree[root<<1].sum += (tree[root<<1].r-tree[root<<1].l+1)*tmp;
        tree[root<<1|1].sum += (tree[root<<1|1].r-tree[root<<1|1].l+1)*tmp;
        tree[root].add = 0;
    }
}
void updateAdd(int root,int l,int r,int val)
{
    pushdown(root);
    if(tree[root].l>=l&&tree[root].r<=r)
    {
        tree[root].add+=val;
        tree[root].sum+=(tree[root].r-tree[root].l+1)*val;
        return ;
    } pushdown(root);
    int mid=(tree[root].l+tree[root].r)>>1;
    if(l<=mid)
        updateAdd(root<<1,l,r,val);
        if(r>mid)
        updateAdd(root<<1|1,l,r,val);
    tree[root].sum=tree[root<<1].sum+tree[root<<1|1].sum;
}
void updateSet(int root,int l,int r,int val)
{

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