HDOJ-1698 Just a Hook

区间覆盖问题，用到线段树，延迟操作.

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <queue>
#define maxn 100005
using namespace std;
typedef long long ll;

int num[maxn<<2], add[maxn<<2];

void Build(int n, int l, int r){

    if(l == r){
        num[n] = 1;
        return ;
    }
    int mid = (l + r) >> 1;
    Build(n<<1, l, mid);
    Build(n<<1|1, mid+1, r);
    num[n] = num[n<<1] + num[n<<1|1]; 
}
void Pushdown(int n, int l){

    if(add[n]){

        num[n<<1] = (l - l / 2) * add[n];
        num[n<<1|1] = l / 2 * add[n];
        add[n<<1] = add[n<<1|1] = add[n];
        add[n] = 0;
    }
}
void Update(int n, int l, int r, int L, int R, int d){

    if(l == L && R == r){
        num[n] = (r - l + 1) * d;
        add[n] = d;
        return ; 
    }
    Pushdown(n, r - l + 1);
    int mid = (l + r) >> 1;
    if(R <= mid)
     Update(n<<1, l, mid, L, R, d);
    else if(L > mid)
     Update(n<<1|1, mid+1, r, L, R, d);
    else{
        Update(n<<1, l, mid, L, mid, d);
        Update(n<<1|1, mid+1, r, mid+1, R, d);
    }
    num[n] = num[n<<1] + num[n<<1|1]; 
}
int main(){

//  freopen("in.txt", "r", stdin);
    int t, p = 0;

    cin >> t;
    while(t--){

        memset(add, 0, sizeof(add));
        int n, q;
        scanf("%d%d", &n, &q);
        Build(1, 1, n);
        int a, b, c;
        for(int i = 0; i < q; i++){

            scanf("%d%d%d", &a, &b, &c);
            Update(1, 1, n, a, b, c);
        }
        printf("Case %d: The total value of the hook is %d.\n", ++p, num[1]); 
    }
    return 0;
}