HDU 1698 Just a Hook 线段树 区间修改

题意：给一个长度为n的棍子，每点初始长度为1，可以进行若干操作，每个操作将区间[x,y]内的长度变为1，2或3，求出进行所有操作之后棍子的总长度
思路：线段树模版题。树的每个节点存储区间和，每次操作之后更新各区间和即可

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e6+5;
const int inf = 0x3f3f3f3f;
int T, n, q, tree[maxn], lz[maxn];
void pushdown(int p, int l, int r)
{
	if (lz[p]) {
		lz[p<<1] = lz[p];
		lz[p<<1|1] = lz[p];
		int mid = (l+r)>>1;
		tree[p<<1] = lz[p]*(mid-l+1);
		tree[p<<1|1] = lz[p]*(r-mid);
		lz[p] = 0;
	}
}
void build(int p, int l, int r)
{
	if (l == r) {
		tree[p] = 1;
		return;
	}
	int mid = (l+r)>>1;
	build(p<<1, l, mid);
	build(p<<1|1, mid+1, r);
	tree[p] = tree[p<<1] = tree[p<<1|1] = 1;
}
void update(int k, int x, int y, int l, int r, int p)
{
	if (x <= l && y >= r) {
		lz[p] = k;
		tree[p] = k*(r-l+1);
		return;
	}
	pushdown(p, l, r);
	int mid = (l+r)>>1;
	if (x <= mid) {
		update(k, x, y, l, mid, p<<1);
	}
	if (y > mid) {
		update(k, x, y, mid+1, r, p<<1|1);
	}
	tree[p] = tree[p<<1]+tree[p<<1|1];
}
int query(int p, int x, int y, int l, int r)
{
	if (x <= l && y >= r)
		return tree[p];
	pushdown(p, l, r);
	int mid = (l+r)>>1, ans = 0;
	if (l != r) {
		if (x <= mid)
			ans += query(p<<1, x, y, l, mid);
		if (y > mid)
			ans += query(p<<1|1, x, y, mid+1, r);
	}
	return ans;
}
int main()
{
	scanf("%d", &T);
	for (int t = 1; t <= T; t++) {
		memset(lz, 0, sizeof(lz));
		memset(tree, 0, sizeof(tree));
		scanf("%d%d", &n, &q);
		int x, y, z;
		build(1, 1, n);
		for (int i = 0; i < q; i++) {
			scanf("%d%d%d", &x, &y, &z);
			update(z, x, y, 1, n, 1);
		}
		printf("Case %d: The total value of the hook is %d.\n", t, query(1, 1, n, 1, n));
	}
}