hdu 1698 Just a Hook(线段树)

传送门：点击打开链接

线段树区间操作入门题：

2种操作：

1：区间覆盖

2：区间查询

在每一个节点设置一个color标记，当需要对某一个区间覆盖的时候只需要把coler标记向下传递。然后在pushdown操作的时候再将标记修改为实际的值。这样就节省了复杂度>

没什么多说的。刚开始学线段树。加油吧。

#include <cstdio>
#define maxn 100010
struct Node
{
    int l,r,sum;
    int c;
}tree[maxn<<2];

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

inline void pushdown(int id)
{
    if(tree[id].c)
    {
        int len = tree[id].r-tree[id].l+1;
        tree[id<<1].c = tree[id<<1|1].c = tree[id].c;
        tree[id<<1].sum = tree[id].c*(len-(len>>1));
        tree[id<<1|1].sum = tree[id].c*(len>>1);
        tree[id].c = 0;
    }
}

void build(int id,int l,int r)
{
    tree[id].l = l;
    tree[id].r = r;
    tree[id].c = 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 op(int id,int l,int r,int c)
{
    if(l <= tree[id].l && tree[id].r <= r)
    {
        tree[id].c =c;
        tree[id].sum = c*(tree[id].r-tree[id].l+1);
        return;
    }
    pushdown(id);
    int mid = (tree[id].l+tree[id].r)>>1;
    if(l <= mid) op(id<<1,l,r,c);
    if(mid < r) op(id<<1|1,l,r,c);
    pushup(id);

}

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

int main()
{
    int T;
    scanf("%d",&T);
    for(int ks = 1;ks <= T;ks++)
    {
        int n,q;
        scanf("%d %d",&n,&q);
        build(1,1,n);
       // printf("%d\n",query(1,1,n));
        while(q--)
        {
            int l,r,c;
            scanf("%d %d %d",&l,&r,&c);
            op(1,l,r,c);
        }
        printf("Case %d: The total value of the hook is %d.\n",ks,query(1,1,n));
    }
    return 0;
}