Maximum Weight Subset
题意:
给你一棵树,每个节点都有一个权值。选若干个点两两距离大于
k
k
k且点权和最大。
分析:
树形
d
p
dp
dp。
设
d
p
[
i
]
[
j
]
dp[i][j]
dp[i][j]表示以
i
i
i为根的子树种距离
i
i
i为
j
j
j的答案。则我们最后的答案肯定是
r
e
s
=
m
a
x
(
r
e
s
,
d
p
[
i
]
[
j
]
)
res = max(res, dp[i][j])
res=max(res,dp[i][j]),当
0
≤
j
≤
k
+
1
\ 0 \le j \le k+1
0≤j≤k+1。
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200 + 5;
int n, k, w[maxn];
int dp[maxn][maxn], tmp[maxn];
struct Edge {
int to, next;
} edges[maxn << 1];
int tot = 1, head[maxn];
void addEdge(int u, int v) {
edges[++tot] = {v, head[u]};
head[u] = tot;
}
void dfs(int u, int f) {
dp[u][0] = w[u];
for (int i = head[u], v; i; i = edges[i].next) {
v = edges[i].to;
if (v == f) continue;
dfs(v, u);
for (int j = 1; j <= k; j++) tmp[j] = dp[u][j];
for (int j = 1; j <= k; j++) {
for (int l = 0; l <= k + 1; l++) if (l + j + 1 > k) {
dp[u][min(j, l + 1)] = max(dp[u][min(j, l + 1)], tmp[j] + dp[v][l]);
}
}
dp[u][0] += max(dp[v][k], dp[v][k + 1]);
dp[u][k + 1] += max(dp[v][k], dp[v][k + 1]);
}
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
for (int i = 1, u, v; i < n; i++) {
scanf("%d%d", &u, &v);
addEdge(u, v);
addEdge(v, u);
}
dfs(1, 0);
int res = 0;
for (int i = 0; i <= k + 1; i++) res = max(res, dp[1][i]);
printf("%d\n", res);
return 0;
}