POJ2378 - Tree Cutting

最新推荐文章于 2020-03-10 17:45:45 发布

Lili_go

最新推荐文章于 2020-03-10 17:45:45 发布

阅读量212

点赞数

分类专栏：随笔文章标签：动态规划

本文链接：https://blog.csdn.net/Lili_go/article/details/81395423

版权

随笔专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Description

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.

Output

* Lines 1..?: Each line contains a single integer, the number (from 1..N) of a barn whose removal splits the network into pieces each having at most half the original number of barns. Output the barns in increasing numerical order. If there are no suitable barns, the output should be a single line containing the word "NONE".

Sample Input

Sample Output

3
8

题意：

给定一棵无根树，输出删除某一结点能得到一个连通度为k的树的结点编号

分析：

对于任意一棵子树，求出其最大子树的连通度，若其（最大子树连通度<=N/2）并且（N-当前子树的总连通度<=N/2），则说明该结点符合要求。

代码：

#include<iostream>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<algorithm>
#define INF 0xffffff
using namespace std;

int N;
int x, y;
vector<int> Tree[10005];
vector<int> Vis(10005);
vector<int> Children(10005);
vector<int> V;

int DFS(int n) {
   int bigger = 0;
   for (int i = 0; i < Tree[n].size(); i++)
       if (!Vis[Tree[n][i]]) {
           Vis[Tree[n][i]] = 1;
           int tmp = DFS(Tree[n][i]);
           Children[n] += tmp;
           if (bigger < tmp)
               bigger = tmp;
       }
   if (bigger <= N / 2 && (N - Children[n]) <= N / 2)
       V.push_back(n);
   return Children[n];
}
int main()
{
   cin >> N;
   for (int i = 1; i < N; i++) {
       cin >> x >> y;
       Tree[x].push_back(y);
       Tree[y].push_back(x);
   }
   Vis.assign(10005, 0);
   Children.assign(10005, 1);
   Vis[1] = 1;
   DFS(1);
   sort(V.begin(), V.end());
   if (!V.size())
       cout << "NONE" << endl;
   for (int i = 0; i < V.size(); i++)
       cout << V[i] << endl;
   return 0;
}