Information Disturbing （树形dp+二分）

最新推荐文章于 2021-09-14 18:17:13 发布

闻道-问道

最新推荐文章于 2021-09-14 18:17:13 发布

阅读量533

点赞数

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

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

版权

在战场上，破坏敌人的通信系统是取胜的关键。已知有n名敌军士兵，他们通过n-1条通信线路建立联系。任务是切断一些线路，确保前线士兵无法将战场信息传递给总指挥官。线路有成本，并且设备的功率上限和寿命有限。求解在不超过设备寿命的前提下，最小化设备的功率上限，以完成任务。

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

In the battlefield , an effective way to defeat enemies is to break their communication system.
The information department told you that there are n enemy soldiers and their network which have n-1 communication routes can cover all of their soldiers. Information can exchange between any two soldiers by the communication routes. The number 1 soldier is the total commander and other soldiers who have only one neighbour is the frontline soldier.
Your boss zzn ordered you to cut off some routes to make any frontline soldiers in the network cannot reflect the information they collect from the battlefield to the total commander( number 1 soldier).
There is a kind of device who can choose some routes to cut off . But the cost (w) of any route you choose to cut off can’t be more than the device’s upper limit power. And the sum of the cost can’t be more than the device’s life m.
Now please minimize the upper limit power of your device to finish your task.
<