HDU - 1698 Just a Hook（线段树区间所有数修改为某值）

传送门

---

题目大意

给出一个初始全为$1$的序列，现在有多种操作每次都可以将区间$[x,y]$的数都修改为$val$，最后求出序列所有数的和。

解题思路

和正常的线段树一样，只是将区间修改变成将树上保存的区间的和变为$val\ast (r-l+1)$，因此只是在普通维护区间和的线段树基础上，将维护树的求和都变为直接赋值，懒惰标记也是直接赋值。

//
// Created by Happig on 2020/11/2
//
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define fi first
#define se second
#define pb push_back
#define ins insert
#define Vector Point
#define ENDL "\n"
#define lowbit(x) (x&(-x))
#define mkp(x, y) make_pair(x,y)
#define mem(a, x) memset(a,x,sizeof a);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const double dinf = 1e300;
const ll INF = 1e18;
const int Mod = 1e9 + 7;
const int maxn = 2e5 + 10;

ll tree[maxn << 1], lz[maxn << 1];
int a[maxn];

void build(int i, int l, int r) {
    if (l == r) {
        tree[i] = 1;
        return;
    }
    int mid = (l + r) >> 1, k = i << 1;
    build(k, l, mid);
    build(k | 1, mid + 1, r);
    tree[i] = tree[k] + tree[k | 1];
}

void pushdown(int i, int l, int r) {
    int mid = (l + r) >> 1, k = i << 1;
    tree[k] = lz[i] * (mid - l + 1), tree[k | 1] = lz[i] * (r - mid);
    lz[k] = lz[k | 1] = lz[i];
    lz[i] = 0;
}

void upd(int i, int l, int r, int x, int y, int val) {
    if (l == x && r == y) {
        tree[i] = val * (r - l + 1);
        lz[i] = val;
        return;
    }
    if (lz[i]) pushdown(i, l, r);
    int mid = (l + r) >> 1, k = i << 1;
    if (y <= mid) upd(k, l, mid, x, y, val);
    else if (x > mid) upd(k | 1, mid + 1, r, x, y, val);
    else upd(k, l, mid, x, mid, val), upd(k | 1, mid + 1, r, mid + 1, y, val);
    tree[i] = tree[k] + tree[k | 1];
}

ll query(int i, int l, int r, int x, int y) {
    if (l == x && r == y) {
        return tree[i];
    }
    if (lz[i]) pushdown(i, l, r);
    int mid = (l + r) >> 1, k = i << 1;
    if (y <= mid) return query(k, l, mid, x, y);
    else if (x > mid) return query(k | 1, mid + 1, r, x, y);
    else return query(k, l, mid, x, mid) + query(k | 1, mid + 1, r, mid + 1, y);
}

int main() {
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T, kase = 0, n, m;
    cin >> T;
    while (T--) {
        memset(lz, 0, sizeof lz);
        cin >> n;
        for (int i = 1; i <= n; i++) a[i] = i;
        build(1, 1, n);
        cin >> m;
        int x, y, val;
        while (m--) {
            cin >> x >> y >> val;
            upd(1, 1, n, x, y, val);
        }
        cout << "Case " << ++kase << ": The total value of the hook is ";
        cout << query(1, 1, n, 1, n) << "." << ENDL;
    }
    return 0;
}