Tree Cutting （树形dp+树的重心变形）

最新推荐文章于 2022-12-01 17:33:37 发布

闻道-问道

最新推荐文章于 2022-12-01 17:33:37 发布

阅读量1.4k

点赞数

分类专栏：树形dp 动态规划文章标签：动态规划树形dp 算法

本文链接：https://blog.csdn.net/a1046765624/article/details/78556158

版权

这篇博客讲述了农夫约翰在发现贝西以高昂代价建立了一个树状网络后起诉贝西的故事。贝西为了报复，打算切断一个谷仓的电力，以使网络分裂成多个连接不超过总谷仓数一半的小网络。文章探讨了如何选择最佳的谷仓进行切断以最大化干扰效果。

摘要由CSDN通过智能技术生成

After Farmer John realized that Bessie had installed a "tree-shaped" network among his N (1 <= N <= 10,000) barns at an incredible cost, he sued Bessie to mitigate his losses.

Bessie, feeling vindictive, decided to sabotage Farmer John's network by cutting power to one of the barns (thereby disrupting all the connections involving that barn). When Bessie does this, it breaks the network into smaller pieces, each of which retains full connectivity within itself. In order to be as disruptive as possible, Bessie wants to make sure that each of these pieces connects together no more than half the barns on FJ.

Please help Bessie determine all of the barns that would be suitable to disconnect.

Input

* Line 1: A single integer, N. The barns are numbered 1..N.

* Lines 2..N: Each line contains two integers X and Y and represents a connection between barns X and Y.