AcWing 1074. 二叉苹果树 树上DP
原题链接
简单
作者:
Snrise
,
2024-05-19 17:58:00
,
所有人可见
,
阅读 4
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define int long long
#define endl '\n'
using namespace std;
const int N = 110;
const int M = N * 2;
int f[N][N];
int h[N], e[M], ne[M], w[M], idx;
int n, m;
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, int fa)
{
for (int i = h[u]; i != -1; i = ne[i])
{
int son = e[i];
if (son == fa)
{
continue;
}
dfs(son, u);
for (int j = m; j >= 0; j--)
{
for (int k = 0; k <= j - 1; k++)
{
f[u][j] = max(f[u][j], f[son][k] + f[u][j - k - 1] + w[i]);
}
}
}
}
signed main(void)
{
memset(h, -1, sizeof(h));
cin >> n >> m;
for (int i = 1; i <= n - 1; i++)
{
int a, b, w;
cin >> a >> b >> w;
add(a, b, w);
add(b, a, w);
}
dfs(1, 0);
cout << f[1][m] << endl;
return 0;
}