【Luogu_P4556】 [Vani有约会]雨天的尾巴 /【模板】线段树合并

题目描述：

思路：

合并线段树
这里讲思路
首先它说要更改x到y的路径，我们不难想到树上差分，在x，y位置+1，在lca,fa(lca)位置-1，最后从下往上合并就行了
我们对每个点开一个权值线段树，记录救济粮，合并简单来说就是儿子对儿子，没儿子就抢过来。

$code$

#include<iostream>
#include<cstdio>
#include<algorithm>

using namespace std;

const int MAXN = 1e5 + 5;

int n, q, rex[MAXN], rey[MAXN], rez[MAXN], root[MAXN], cnt;

int L[MAXN], H[MAXN];

int head[MAXN], tot=1, f[MAXN][25], dep[MAXN];

struct node {
	int to, next;
} edge[MAXN * 2];
struct SgT {
	int l, r, maxx, ans;
	#define l(p) tree[p].l
	#define r(p) tree[p].r
	#define maxn(p) tree[p].maxx
	#define ans(p) tree[p].ans
}tree[MAXN * 100];

void add(int x, int y) {
	edge[++tot] = (node){y, head[x]};
	head[x] = tot;
}

void dfs(int x, int fa) {
	dep[x] = dep[fa] + 1, f[x][0] = fa;
	for(int i = head[x]; i; i = edge[i].next) {
		int y = edge[i].to;
		if(y == fa) continue;
		dfs(y, x);
	}
}

void init() {
	for(int j = 1; j <= 20; j ++)
		for(int i = 0; i <= n; i ++)
			f[i][j] = f[f[i][j - 1]][j - 1];
}

int lca(int x, int y) {
	if(dep[x] < dep[y]) swap(x, y);
	for(int i = 20; i >= 0; i --)
		if(dep[f[x][i]] >= dep[y]) x = f[x][i];
	if(x == y) return x;
	for(int i = 20; i >= 0; i --)
		if(f[x][i] != f[y][i]) x = f[x][i], y = f[y][i];
	return f[x][0];
}

void lsh() {
	for(int i = 1; i <= q; i ++)
		L[i] = rez[i];
	sort(L + 1, L + 1 + q);
	int m = unique(L + 1, L + 1 + q) - L - 1;
	for(int i = 1; i <= q; i ++) {
		int k = lower_bound(L + 1, L + 1 + m, rez[i]) - L;
		H[k] = rez[i];
		rez[i] = k;
	}
}

void update(int p) {
	if(maxn(l(p)) >= maxn(r(p))) maxn(p) = maxn(l(p)), ans(p) = ans(l(p));
	else maxn(p) = maxn(r(p)), ans(p) = ans(r(p));
}

void Insert(int &p, int x, int z, int l, int r) {
	if(l > r) return;
	if(!p)
		p = ++cnt;
	if(l == r && l == x) {
		maxn(p) += z, ans(p) = x;
		return ;
	}
	int mid = l + r >> 1;
	if(x <= mid) Insert(l(p), x, z, l, mid);
	else Insert(r(p), x, z, mid + 1, r);
	update(p);
}

int Merge(int p1, int p2, int l, int r) {
	if(!p1 || !p2) return p1 + p2;
	int p = ++cnt;
	if(l == r) {
		maxn(p) = maxn(p1) + maxn(p2);
		ans(p) = l;
		return p;
	}
	int mid = l + r >> 1;
	l(p) = Merge(l(p1), l(p2), l, mid);
	r(p) = Merge(r(p1), r(p2), mid+1, r);
	update(p);
	return p;
}

void dfs2(int x, int fa) {
	for(int i = head[x]; i; i = edge[i].next) {
		int y = edge[i].to;
		if(y == fa) continue;
		dfs2(y, x), root[x] = Merge(root[x], root[y], 1, MAXN - 5);
	}
}

int main() {
	scanf("%d%d", &n, &q);
	for(int i = 1; i < n; i ++) {
		int x, y;
		scanf("%d%d", &x, &y);
		add(x, y), add(y, x);
	}
	add(0, 1), add(1, 0);
	dfs(0, 0);
	init();
	for(int i = 1; i <= q; i ++)
		scanf("%d%d%d", &rex[i], &rey[i], &rez[i]);
	lsh();
	for(int i = 1; i <= q; i ++) {
		int k = lca(rex[i], rey[i]);
		Insert(root[rex[i]], rez[i], 1, 1, MAXN - 5);
		Insert(root[rey[i]], rez[i], 1, 1, MAXN - 5);
		Insert(root[k], rez[i], -1, 1, MAXN - 5);
		Insert(root[f[k][0]], rez[i], -1, 1, MAXN - 5);
	}
	dfs2(0, 0);
	for(int i = 1; i <= n; i ++) {
		if(!maxn(root[i])) printf("0\n");
		else printf("%d\n", H[ans(root[i])]);
	}
	return 0;
}