树形dp

题单：https://www.luogu.com.cn/training/4840#problems

两道类似的题目

https://www.luogu.com.cn/problem/P2014

#include <bits/stdc++.h>
using namespace std;
//Filename: 2014.cpp
//
//Author: dezhonger - csdisassembly@gmail.com

//Create: 2021-04-11 23:00:55


#define Debug(x) cout<<#x<<"="<<x<<endl;

typedef long long LL;

const int N = 310;
int k, s, n, m, w[N], sz[N], f[N][N];
int idx, h[N], ne[N << 1], e[N << 1];

void add(int a, int b) {
	e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}

void dfs(int u, int fa) {
	sz[u] = 1;
	f[u][1] = w[u];
	for (int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
		dfs(v, u);
		sz[u] += sz[v];
		for (int j = min(m, sz[u]); j >= 1; j--) {
			for (int k = 0; k <= min(j - 1, min(m - 1, sz[v])); k++) {
				f[u][j] = max(f[u][j], f[v][k] + f[u][j - k]);
			}
		}
	}
}

int main() {
    ios::sync_with_stdio (false);
    cin.tie (0);
	cin >> n >> m;
	memset(h, -1, sizeof h);
	for (int i = 1; i <= n; i++) {
		cin >> k >> w[i];
		add(k, i);
	}
	m++;
	dfs(0, -1);
	cout << f[0][m] << endl;
    return 0;
}

https://www.luogu.com.cn/problem/P2015

#include <bits/stdc++.h>
using namespace std;
//Filename: 2015.cpp
//
//Author: dezhonger - csdisassembly@gmail.com

//Create: 2021-04-11 20:48:39



#define Debug(x) cout<<#x<<"="<<x<<endl;

typedef long long LL;

const int N = 110;
int h[N], e[N << 1], ne[N << 1], w[N << 1];
int n, q, idx;
int f[N][N], sz[N];

void add(int a, int b, int c) {
	e[idx] = b, ne[idx] = h[a], h[a] = idx, w[idx] = c, idx++;
}

//f[i][j]以i为根选j条边的最大值
void dfs(int u, int fa) {
	for (int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
		if (v == fa) continue;
		dfs(v, u);
		sz[u] += sz[v] + 1;
		//这里必须要逆序枚举
		for (int j = min(q, sz[u]); j > 0; j--) {
			//枚举儿子选多少条边
			for (int k = 0; k <= min(sz[v], j - 1); k++) {
				f[u][j] = max(f[u][j], f[u][j - 1 - k] + f[v][k] + w[i]);
			}
		}
	}
}

int main() {
	ios::sync_with_stdio (false);
	cin.tie (0);
	cin >> n >> q;
	idx = 0;
	memset(h, -1, sizeof h);
	memset(f, 0, sizeof f);
	//sz数组表示以当前节点为根的子树的边的数量
	memset(sz, 0, sizeof sz);
	for (int i = 0; i < n - 1; i++) {
		int x, y, z;
		cin >> x >> y >> z;
		add(x, y, z), add(y, x, z);
	}
	dfs(1, -1);
	cout << f[1][q] << endl;
	return 0;
}

 

 

总结一下：这两个题目在树形dp的时候，其实是循环每个节点的所有儿子，然后依次计算。这里有点类似于01背包，每个儿子就是一个物品，因此dfs函数里的第一层循环必须要逆序枚举。细节参考代码。

 

 

 

https://www.luogu.com.cn/problem/P1273

f[i][j]：以i为根选择j个顾客的最大收益

#include <bits/stdc++.h>
using namespace std;
//Filename: 1273.cpp
//
//Author: dezhonger - csdisassembly@gmail.com

//Create: 2021-04-27 21:42:56


#define Debug(x) cout<<#x<<"="<<x<<endl;

const int N = 3010;
int h[N], ne[N << 1], e[N << 1], w[N << 1], idx;
int n, m, k, leaf[N], sz[N];
//以i为根选j个顾客能获得的最大收益
int f[N][N];


void add(int a, int b, int c) {
	e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx++;
}

void dfs(int u) {
	if (leaf[u]) {
		//如果是叶子节点
		f[u][1] = leaf[u];
		sz[u] = 1;
		return ;
	}
	sz[u] = 1;
	
	for (int i = h[u]; ~i; i = ne[i]) {
		int v = e[i], weight = w[i];
		dfs(v);
		sz[u] += sz[v];
		for (int j = min(m, sz[u]); j >= 1; j--) {
			for (int k = 0; k <= min(sz[v], j); k++) {
				f[u][j] = max(f[u][j], f[v][k] + f[u][j - k] - weight);
			}
		}
	}
}

int main() {
    ios::sync_with_stdio (false);
    cin.tie (0);
	memset(f, -0x3f, sizeof f);
	memset(h, -1, sizeof h);
	idx = 0;
	cin >> n >> m;
	for (int i = 1; i <= n - m; i++) {
		cin >> k;
		for (int j = 1; j <= k; j++) {
			int x, y;
			cin >> x >> y;
			add(i, x, y);
		}
	}

	//读入叶子节点的收益
	for (int i = 1; i <= m; i++) cin >> leaf[n - m + i];
	//选0个顾客的收益是0
	for (int i = 1; i <= n; i++) f[i][0] = 0;
	dfs(1);

	for (int i = m; i >= 0; i--) {
		if (f[1][i] >= 0) {
			cout << i << endl;
			return 0;
		}
	}
    return 0;
}

 

https://www.luogu.com.cn/problem/P3047

换根dp：

u为v的父亲

d[v][k] = f[v][k] + d[u][k -1] - f[v][k - 2]

#include <bits/stdc++.h>
using namespace std;
//Filename: 3047.cpp
//
//Author: dezhonger - csdisassembly@gmail.com

//Create: 2021-04-27 22:20:53


#define Debug(x) cout<<#x<<"="<<x<<endl;

const int N = 100010;
int h[N], ne[N << 1], e[N << 1], idx;
int w[N], n, k;
int f[N][25], d[N][25];

void add(int a, int b) {
	e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}

void dfs1(int u, int fa) {
	f[u][0] = w[u];
	for (int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
		if (v == fa) continue;
		dfs1(v, u);
	}
	for (int i = 1; i <= k; i++) {
		f[u][i] = w[u];
		for (int j = h[u]; ~j; j = ne[j]) {
			int v = e[j];
			if (v == fa) continue;
			f[u][i] += f[v][i - 1];
		}
	}
}

void dfs2(int u, int fa) {
	for (int i = 0; i <= k; i++) d[u][i] = f[u][i];
	if (fa != -1) {
		for (int i = 1; i <= k; i++) {
			if (i >= 1) d[u][i] += d[fa][i - 1];
			if (i >= 2) d[u][i] -= f[u][i - 2];
		}
	}
	for (int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
		if (v == fa) continue;
		dfs2(v, u);
	}
}

int main() {
	ios::sync_with_stdio (false);
	cin.tie (0);
	memset(h, -1, sizeof h);
	memset(f, 0, sizeof f);
	idx = 0;
	cin >> n >> k;
	for (int i = 1; i < n; i++) {
		int x, y;
		cin >> x >> y;
		add(x, y), add(y, x);
	}
	for (int i = 1; i <= n; i++) cin >> w[i];

	dfs1(1, -1);
	dfs2(1, -1);
	for (int i = 1; i <= n; i++) cout << d[i][k] << endl;
	return 0;
}