[树形DP] poj 3659 Cell Phone Network

最小支配集，求最小的点集覆盖全部的点。 /** [树形DP] poj 3659 Cell Phone Network 给定一棵树，求最小支配集 dp[i][0] = sum(min(dp[s][2],dp[s][1]))本身没被选，父节点被选中 dp[i][1] = sum(min(dp[s][1],dp[s][2]))本身没被选，某儿子结点被选中 dp[i][2] = sum(min(dp[s]

>>阅读原文<<