1021 Deepest Root (25 分) 并查集+dfs邻接表

最新推荐文章于 2021-07-22 22:46:35 发布

ZXX_1999

最新推荐文章于 2021-07-22 22:46:35 发布

阅读量224

点赞数

分类专栏：图的遍历

本文链接：https://blog.csdn.net/ZXX_1999/article/details/103282208

版权

图的遍历专栏收录该内容

4 篇文章 0 订阅

订阅专栏

这篇博客介绍了一个寻找树中最深根节点的问题，要求在给定的连通无环图中找到使树高度最大的根节点。输入包含图的节点数和边信息，输出是最深根节点的编号。当有多于一个最深根节点时，按节点编号升序排列。若给定图不是树，则输出其连通组件数量。

摘要由CSDN通过智能技术生成

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 (≤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:

Sample Output 1:

3
4
5

Sample Input 2:

Sample Output 2:

Error: 2 components

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int maxn = 100010;
vector<int> G[maxn];

bool isroot[maxn];
int father[maxn];
int findfather(int x) {
	int a = x;
	while (x != father[x]) {
		x = father[x];
	}

	while (a != father[a]) {
		int z = a;
		a = father[a];
		father[z] = x;
	}
	return x;

}

void Union(int a, int b) {//合并，Union
	int faA = findfather(a);
	int faB = findfather(b);
	if (faA != faB) {
		father[faA] = faB;
	}


}

void init(int n) {
	for (int i = 1; i <= n; i++) {
		father[i] = i;
	}
}

int calblock(int n) {
	int block = 0;
	for (int i = 1; i <= n; i++) {
		isroot[findfather(i)] = true;
	}
	for (int i = 1; i <= n; i++) {
		if (isroot[i] == true)block++;
	}
	return block;
}

int maxheight;
vector<int> temp, ans;

void dfs(int u, int height, int pre) {
	if (height > maxheight) {
		temp.clear();
		temp.push_back(u);
		maxheight = height;

	}
	else if (height == maxheight) {
		temp.push_back(u);
	}

	for (int i = 0; i < G[u].size(); i++) {
		if (G[u][i] == pre)continue;
		dfs(G[u][i], height + 1, u);
	}
}
int main() {
	int a, b, n;
	scanf("%d", &n);

	init(n);
	for (int i = 1; i < n; i++) {
		scanf("%d%d", &a, &b);
		G[a].push_back(b);
		G[b].push_back(a);
		Union(a, b);
	}

	int block = calblock(n);
	if (block != 1) {
		printf("Error: %d components\n", block);
	}
	else {
		dfs(1, 1, -1);
		ans = temp;
		dfs(ans[0], 1, -1);
		for (int i = 0; i < temp.size(); i++) {
			ans.push_back(temp[i]);
		}
		sort(ans.begin(), ans.end());
		printf("%d\n", ans[0]);
		for (int i = 1; i < ans.size(); i++) {
			if (ans[i] != ans[i - 1]) {
				printf("%d\n", ans[i]);
			}
		}
	}
	return 0;
}