PTA甲级考试真题练习21——1021 Deepest Root

题目

生词生字

1. A graph which is connected and acyclic can be considered a tree.
   一个无环连通图可以被考虑是一个树

思路

首先判断是不是连通图，如果不是统计连通分量个数并输出，如果是的话，对每一个结点进行深度优先遍历，记录其最深长度，然后排序后输出最小的那几个。
注意：按邻接表存储，不然测试点3会内存不足。

代码

#include <iostream>
#include<string.h>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<list>
using namespace std;
#define nmax 10005 
#define inf 999999
vector<int> tmp;
vector<vector<int>> graph_vec;
int n;
int visited[nmax];

int maxdeep = 0;

typedef struct
{
	int ID;
	int deep;
}Node;
vector<Node> vec;
void DFS(int cur,int deep)
{
	if (deep > maxdeep)
		maxdeep = deep;
	visited[cur] = 1;
	for (int i = 0; i < graph_vec[cur].size(); ++i)
	{
		if (visited[graph_vec[cur][i]] == 0)
			DFS(graph_vec[cur][i], deep + 1);
	}
}

bool cmp(const Node& a, Node& b)
{
	if (a.deep != b.deep)
		return a.deep > b.deep;
	else
		return a.ID < b.ID;
}

int main()
{
	cin >> n;
	graph_vec.resize(n);
	for (int i = 0; i < n - 1; ++i)
	{
		int u, v;
		cin >> u >> v;
		graph_vec[u-1].push_back(v-1);
		graph_vec[v-1].push_back(u-1);
	}
	fill(visited, visited + n, 0);
	int component = 0;
	//判断是否是连通图
	for (int i = 0 ; i < n; ++i)
	{
		if (visited[i] == 0)
		{
			DFS(i, 0);
			++component;
		}
	}
	if (component > 1)
	{
		cout << "Error: " << component << " components";
		return 0;
	}
	fill(visited, visited + n, 0);
	for (int i = 0; i < n; ++i)
	{
			DFS(i,0);
			Node node;
			node.ID = i+1;
			node.deep = maxdeep;
			vec.push_back(node);
			maxdeep = 0;
			fill(visited, visited + n, 0);
	}
	sort(vec.begin(), vec.end(), cmp);
	cout << vec[0].ID << endl;
	for (int i =1;i<vec.size();++i)
	{
		if (vec[i].deep == vec[0].deep)
			cout << vec[i].ID << endl;
		else
			break;
	}
	return 0;
}