1021. Deepest Root (25)
A graph which is connected and acyclic can be considered a tree. The height 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 (<=10000) 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 5Sample Output 1:
3 4 5Sample Input 2:
5 1 3 1 4 2 5 3 4Sample Output 2:
Error: 2 components
#include<iostream> #include<cstdio> #include<vector> #include<cstring> using namespace std; #define maxn 10001 vector<int>q[maxn]; bool vis[maxn]; int deeps[maxn]; int deep; void dfs(int now,int cnt) { vis[now] = 1; if(deep < cnt) { deep =cnt; } int len = q[now].size(); for(int i = 0; i < len; i++) { int to = q[now][i]; if(vis[to] == 0) { vis[to] = 1; dfs(to,cnt+1); vis[to] = 0; } } } void dfs1(int now) { vis[now] = 1; int len = q[now].size(); for(int i = 0; i < len; i++) { int to = q[now][i]; if(vis[to] == 0) { vis[to] = 1; dfs1(to); } } } int main() { int n, m; int u,v; scanf("%d", &n); for(int i = 1; i < n; i++) { scanf("%d%d", &u, &v); q[u].push_back(v); q[v].push_back(u); } int maxDeep = 0; int flag = 0; int sum = 0; for(int i=1; i <= n; i++) { if(vis[i] == 0) { sum++; dfs1(i); } } if(sum > 1) flag = 1; if(flag == 1) { printf("Error: %d components\n",sum); } else { for( int i = 1; i <= n; i++) { memset(vis, 0, sizeof(vis)); deep = 0; dfs(i,0); deeps[i] = deep; if(maxDeep < deep) { maxDeep = deep; } } for(int i = 1; i <= n; i++) { if(deeps[i] == maxDeep) printf("%d\n",i); } } }