HDU 1698 Just a Hook（线段树成段更新求和）

HDU 1698 Just a Hook（线段树成段更新求和）

ACM

题目地址：HDU 1698 Just a Hook

题意： 
[1,10w]范围，初始化是1，然后把多组[a,b]改成c，问最后总的和。

分析： 
线段树成段更新裸题。

代码：

/*
*  Author:      illuz <iilluzen[at]gmail.com>
*  Blog:        http://blog.csdn.net/hcbbt
*  File:        1698.cpp
*  Create Date: 2014-08-12 10:37:06
*  Descripton:  segment tree 
*/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define repf(i,a,b) for(int i=(a);i<=(b);i++)

#define lson(x) ((x) << 1)
#define rson(x) ((x) << 1 | 1)

typedef long long ll;

const int N = 100100;
const int ROOT = 1;

struct seg {
    ll w;
    ll flag;
};

struct segment_tree {
    seg node[N << 2];

    void update(int pos) {
        node[pos].w = node[lson(pos)].w + node[rson(pos)].w;
    }

    void build(int l, int r, int pos) {
        node[pos].flag = 0;
        if (l == r) {
            node[pos].w = 1;
            return;
        }
        int m = (l + r) >> 1;
        build(l, m, lson(pos));
        build(m + 1, r, rson(pos));
        update(pos);
    }

    void push(int l, int r, int pos) {
        seg& fa = node[pos];
        seg& lhs = node[lson(pos)];
        seg& rhs = node[rson(pos)];
        int len = r - l + 1;
        if (fa.flag) {
            lhs.flag = fa.flag;
            rhs.flag = fa.flag;
            lhs.w = fa.flag * (len - (len >> 1));
            rhs.w = fa.flag * (len >> 1);
            fa.flag = 0;
        }
    }

    // add the point [x,y] with z
    void modify(int l, int r, int pos, int x, int y, ll z) {
        if (x <= l && r <= y) {
            int len = r + 1 - l;
            node[pos].w = z * len;
            node[pos].flag = z;
            return;
        }
        push(l, r, pos);
        int m = (l + r) >> 1;
        if (x <= m)
            modify(l, m, lson(pos), x, y, z);
        if (y > m)
            modify(m + 1, r, rson(pos), x, y, z);
        update(pos);
    }

    // query the segment [x, y]
    ll query(int l, int r, int pos, int x, int y) {
        if (x <= l && r <= y)
            return node[pos].w;
        push(l, r, pos);
        int m = (l + r) >> 1;
        ll res = 0;
        if (x <= m)
            res += query(l, m, lson(pos), x, y);
        if (y > m)
            res += query(m + 1, r, rson(pos), x, y);
        return res;
    }

} sgm;

int t, n, m, a, b, c;

int main() {
    scanf("%d", &t);
    repf (cas, 1, t) {
        scanf("%d", &n);
        sgm.build(1, n, ROOT);
        scanf("%d", &m);
        while (m--) {
            scanf("%d%d%d", &a, &b, &c);
            sgm.modify(1, n, ROOT, a, b, c);
        }
        printf("Case %d: The total value of the hook is %lld.\n", cas, sgm.query(1, n, ROOT, 1, n));
    }
    return 0;
}