传送门
题解:由于直接考虑一棵子树不好转移状态,所以考虑每一条边对答案的贡献,
dp[p][i]表示以p为根的子树,选i个黑点,对于整个树的答案的贡献。枚举p的每个儿子v,就转化成一个背包问题:
dp[p][i]=max(dp[p][i],dp[p][i-j]+dp[v][j]+e[ii].w*(j*(m-j)+(siz[v]-j)*(n-m-siz[v]+j)));
至于dp数组初始化赋值的问题:
for (int i=2;i<=m;++i) dp[p][i]=-0x3f3f3f3f;
留坑日后尽快解答。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAXN=2006;
int n,m;
int head[MAXN],edge=0,siz[MAXN];
struct EDGE {
int v,nxt;
ll w;
}e[MAXN<<1];
ll dp[MAXN][MAXN];
inline int read() {
int x=0;char c=getchar();
while (c<'0'||c>'9') c=getchar();
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x;
}
inline void adde(int u,int v,ll w) {
e[edge].nxt=head[u],e[edge].v=v,e[edge].w=w,head[u]=edge++;
e[edge].nxt=head[v],e[edge].v=u,e[edge].w=w,head[v]=edge++;
}
void dfs(int p,int fa) {
siz[p]=1;
for (int i=2;i<=m;++i) dp[p][i]=-0x3f3f3f3f;
for (int ii=head[p];~ii;ii=e[ii].nxt) {
int v=e[ii].v;
if (v^fa) {
dfs(v,p);
siz[p]+=siz[v];
for (int i=min(siz[p],m);~i;--i)
for (int j=0;j<=min(siz[v],i);++j)
dp[p][i]=max(dp[p][i],dp[p][i-j]+dp[v][j]+e[ii].w*(j*(m-j)+(siz[v]-j)*(n-m-siz[v]+j)));
}
}
}
int main() {
// freopen("bzoj 4033.in","r",stdin);
memset(head,-1,sizeof(head));
n=read(),m=read();
for (int i=1;i<n;++i) {
int u=read(),v=read();
ll w;scanf("%lld",&w);
adde(u,v,w);
}
dfs(1,0);
printf("%lld\n",dp[1][m]);
return 0;
}