PAT 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 (≤10​4​​) 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

解题思路：
首先先通过深度遍历来判断是否为一颗连通树，若是，再通过dfs遍历每一个结点，记录下它们的最大深度，然后比较输出即可。

参考一个博主的思路：https://www.cnblogs.com/zhanghaijie/p/10229733.html

代码如下：

#include<stdio.h>
#include<algorithm>
#include<vector>
#define MAX 10001
using namespace std;

bool visit[MAX];//记录是否被访问过的结点
vector<vector<int> > v;//构建邻接表
int N,deepest = 0;
int maxdeep = 0;//最大深度

void dfs(int root, int deep) {
	deepest = max(deepest, deep);
	for (int i = 0; i < v[root].size(); i++) {
		if (visit[v[root][i]] == false) {
			visit[v[root][i]] = true;
			dfs(v[root][i], deep+1);
		}
	}
}

int main() {
	int x, y, k = 0;
	scanf("%d", &N);
	v.resize(N + 1);
	for (int i = 0; i < N - 1; i++) {
		scanf("%d%d", &x, &y);
		v[x].push_back(y);
		v[y].push_back(x);
	}
	fill(visit, visit + N + 1, false);
	/*通过dfs遍历结点判断在graph中为一颗树还是多颗树*/
	for (int i = 1; i <= N; i++) {
		if (visit[i] == false) {
			k++;
			visit[i] = true;
			dfs(i, 0);
		}
	}
	if (k > 1)
		printf("Error: %d components", k);
	else {
		int maxi[MAX]; //存储每个root的最大深度
		for (int i = 1; i <= N; i++) {
			deepest = 0;
			fill(visit, visit + N + 1, false);
			visit[i] = true;
			dfs(i, 0);
			maxi[i] = deepest;
			maxdeep = max(maxdeep, deepest);
		}
		for (int i = 1; i <= N; i++) {
			if (maxi[i] == maxdeep)
				printf("%d\n", i);
		}
	}

	return 0;
	
}