0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-02 23:56:29 +00:00
OI-codes/Luogu/P2015/P2015.cpp

46 lines
844 B
C++
Raw Normal View History

2022-04-07 13:44:37 +00:00
#include <iostream>
#include <vector>
using std::cin;
using std::cout;
const char endl = '\n';
const int N = 105;
int n, q, l[N], r[N], a[N], f[N][N];
std::vector<std::pair<int, int>> g[N];
void dfs(int u, int fa) {
for (auto e : g[u]) {
int v = e.first,
w = e.second;
if (v == fa) continue;
dfs(v, u);
for (int k = q; k; k--) {
for (int j = k - 1; j >= 0; j--) {
f[u][k] = std::max(f[u][k], w + f[u][k - j - 1] + f[v][j]);
}
}
}
}
int main() {
std::ios::sync_with_stdio(false);
cin >> n >> q;
for (int i = 1, u, v, w; i < n; i++) {
cin >> u >> v >> w;
g[u].push_back(std::make_pair(v, w));
g[v].push_back(std::make_pair(u, w));
}
dfs(1, -1);
cout << f[1][q] << endl;
return 0;
}