cell_phone_network(树形dp求最小支配集)-CSDN博客

本文探讨了如何在牧农的N个牧场中，通过设置最少数量的手机塔，确保所有牧场都能获得手机信号覆盖的问题。这是一个经典的最小点支配集问题，文章提供了使用动态规划解决该问题的具体思路。

Cell Phone Network

Farmer John has decided to give each of his cows a cell phone in hopes to encourage their social interaction. This, however, requires him to set up cell phone towers on his N (1 ≤ N ≤ 10,000) pastures (conveniently numbered 1..N) so they can all communicate.

Exactly N-1 pairs of pastures are adjacent, and for any two pastures A and B (1 ≤ A ≤ N; 1 ≤ B ≤ N; A ≠ B) there is a sequence of adjacent pastures such that A is the first pasture in the sequence and B is the last. Farmer John can only place cell phone towers in the pastures, and each tower has enough range to provide service to the pasture it is on and all pastures adjacent to the pasture with the cell tower.

Help him determine the minimum number of towers he must install to provide cell phone service to each pasture.

Input

* Line 1: A single integer: N
* Lines 2..N: Each line specifies a pair of adjacent pastures with two space-separated integers: A and B

Output

* Line 1: A single integer indicating the minimum number of towers to install

Sample Input

Sample Output

2

这题就是个求最小点支配集的问题,之前用贪心解过,现在用dp解一下,具体过程看代码吧

转载于:https://www.cnblogs.com/bianjunting/p/11571983.html