hdu 1698 Just a Hook

AC代码：

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

const int N = 100005;

struct node{
    int l,r;
    int setv,sum;
}tree[N<<2];

void pushup(int id){
    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 = tmp;tree[(id<<1)|1].setv = 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].setv = 0;
    }
}

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

void update(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;
        return ;
    }
    pushdown(id);
    int mid = (tree[id].l+tree[id].r)>>1;
    if(l <= mid)
        update(id<<1,l,r,val);
    if(mid < r)
        update((id<<1)|1,l,r,val);
    pushup(id);
}

int ans;

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);
    pushup(id);
}

int main(){
    int T,t = 1;
    scanf("%d",&T);
    while(T--){
        int n,m;
        scanf("%d",&n);
        build(1,1,n);
        scanf("%d",&m);
        int x,y,z;
        while(m--){
            scanf("%d%d%d",&x,&y,&z);
            update(1,x,y,z);
        }
        ans = 0;
        query(1,1,n);
        printf("Case %d: The total value of the hook is %d.\n",t++,ans);
    }
    return 0;
}