HDU1698 线段树板子 将区间改变为某个数

​​​​​​HDU1698

题意：

初始n个数每个数为1，每次操作使[l, r]的所有数变为d，求最终的n个数的和

线段树的查询和更新一定要注意递归的也是r_change(p, l, r, d) l, r不变

spread（）中更新子树时它们的长度为子树的长度 不要忘记左移。

// Decline is inevitable,
// Romance will last forever.
//#include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <deque>
#include <vector>
using namespace std;
#define mst(a, x) memset(a, x, sizeof(a))
#define INF 0x3f3f3f3f
//#define int long long
const int maxn = 1e6 + 10;
const int P = 1e9 + 7;
int n, q;
struct segment_tree {
    int l, r;
    int sum, add;
#define sum(x) tree[x].sum
#define add(x) tree[x].add
#define l(x) tree[x].l
#define r(x) tree[x].r
}tree[maxn << 2];
int t = 0;
void push(int p) {
    sum(p) = sum(p<<1) + sum(p<<1|1);
}
void build(int p, int l, int r) {
    l(p) = l; r(p) = r;
    if(l == r) {
        sum(p) = 1;
        return;
    }
    int mid = (l + r) >> 1;
    build(p<<1, l, mid);
    build(p<<1|1, mid + 1, r);
    push(p);
}
void spread(int p) {
    if(add(p)) {
        sum(p<<1) = add(p) * (r(p<<1) - l(p<<1) + 1);
        sum(p<<1|1) = add(p) * (r(p<<1|1) - l(p<<1|1) + 1);
        add(p<<1) = add(p<<1|1) = add(p);
        add(p) = 0;
    }
    return;
}
void r_change(int p, int l, int r, int d) {
    if(l <= l(p) && r >= r(p)) {
        sum(p) = d * (r(p) - l(p) + 1);
        add(p) = d;
        return;
    }
    spread(p);
    int mid = (l(p) + r(p)) >> 1;
    if(l <= mid) r_change(p<<1, l, r, d);
    if(r > mid) r_change(p<<1|1, l, r, d);
    push(p);
}
int query(int p, int l, int r) {
    if(l <= l(p) && r >= r(p)) return sum(p);
    spread(p);
    int ans = 0;
    int mid = (r(p) + l(p)) >> 1;
    if(l <= mid) ans += query(p<<1, l, r);
    if(r > mid) ans += query(p<<1|1, l, r);
    return ans;
}
void solve() {
    cin >> n >> q;
    for(int i = 1; i <= n * 4; i++) {
        tree[i].sum = 0; tree[i].add = 0;
    }
    build(1, 1, n);
    while(q--) {
        int l, r, d;
        cin >> l >> r >> d;
        r_change(1, l, r, d);
    }
    t++;
    cout << "Case " << t << ": The total value of the hook is ";
    cout << query(1, 1, n) << ".\n";
}
signed main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int T;
    cin >> T;
    while(T--)
        solve();
    return 0;
}