L2-025 分而治之 (25 分)

最新推荐文章于 2022-03-27 00:22:31 发布

moumoumouwang

最新推荐文章于 2022-03-27 00:22:31 发布

阅读量115

点赞数

本文链接：https://blog.csdn.net/moumoumouwang/article/details/114379551

版权

天梯赛专栏收录该内容

35 篇文章 0 订阅

订阅专栏

简简单单dfs

#include <iostream>
#include <cstring>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
const int maxn = 100010;

vector<vector<int>> Node(maxn);
int s;
vector<int> ans;
int max_index, max_height = 0;
void dfs(int index,int height)
{
	if(Node[index].size() == 0)
	{
		if(height == max_height)
		{
			ans.push_back(index);
		}
		else if(height > max_height)
		{
			ans.clear();
			ans.push_back(index);
			max_height = height;
		}
	}
	for(int i = 0; i < Node[index].size(); i++)
	{
		dfs(Node[index][i], height + 1);
	}
}
int main()
{
	int n,x;
	cin >> n;
	ans.resize(n);
	for(int i = 1; i <= n; i++)
	{
		cin >> x;
		if(x != -1) Node[x].push_back(i);
		else s = i;
	}
	dfs(s,1);
	sort(ans.begin(),ans.end());
	cout << max_height << endl;
	cout << ans[0];
	for(int i = 1; i < ans.size(); i++)
	{
		cout << " " << ans[i];
	}
	return 0;
}