1021 Deepest Root(25 分)
A graph which is connected and acyclic can be considered a tree. The hight of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root is called the deepest root.
Input Specification:
Each input file contains one test case. For each case, the first line contains a positive integer N (≤104) which is the number of nodes, and hence the nodes are numbered from 1 to N. Then N−1 lines follow, each describes an edge by given the two adjacent nodes' numbers.
Output Specification:
For each test case, print each of the deepest roots in a line. If such a root is not unique, print them in increasing order of their numbers. In case that the given graph is not a tree, print Error: K components
where K
is the number of connected components in the graph.
Sample Input 1:
5
1 2
1 3
1 4
2 5
Sample Output 1:
3
4
5
Sample Input 2:
5
1 3
1 4
2 5
3 4
Sample Output 2:
Error: 2 components
题意:给定一棵树。问你以哪些结点作为根该树有最深的深度,升序输出这些结点。
如果有多个联通分量则输出error并输出联通分量个数
解法:两遍dfs。
第一次:从任何一个结点出发,到达最远的那个结点(可能是一个集合)一定是deepest root。再从该集合中任何一个点出发到达的最远的结点一定是deepest root。为了去重和升序,用set就可以了。
#include <bits/stdc++.h>
#define pii pair<int, int>
#define ll long long
#define eps 1e-5
using namespace std;
const int maxn = 2e4 + 10;
int n;
vector<int> tree[maxn];
set<int> ans;
bool vis[maxn];
int layer[maxn];
int depth;
void dfs(int id, int d)
{
vis[id] = 1;
layer[id] = d;
depth = max(depth, d);
for(auto idx: tree[id])
if(!vis[idx])
dfs(idx, d + 1);
}
int main()
{
// freopen("/Users/vector/Desktop/testdata.in", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for(int i = 1; i < n; i++)
{
int a, b;
cin >> a >> b;
tree[a].push_back(b);
tree[b].push_back(a);
}
int time = 0;
for(int i = 1; i <= n; i++)
if(!vis[i])
{
dfs(i, 1);
time++;
}
if(time > 1)
{
cout << "Error: " << time << " components" << endl;
return 0;
}
for(int i = 1; i <= n; i++)
if(layer[i] == depth)
ans.insert(i);
memset(vis, 0, sizeof(vis));
depth = 0;
dfs(*ans.begin(), 1);
for(int i = 1; i <= n; i++)
if(layer[i] == depth)
ans.insert(i);
for(auto idx: ans)
cout << idx << endl;
return 0;
}