L2-026 小字辈 (25 分)

最新推荐文章于 2022-08-26 14:15:16 发布

狼狐

最新推荐文章于 2022-08-26 14:15:16 发布

阅读量58

点赞数

分类专栏：天梯

本文链接：https://blog.csdn.net/langhuya/article/details/117001641

版权

天梯专栏收录该内容

98 篇文章 3 订阅

订阅专栏

原题链接

#include <bits/stdc++.h>
using namespace std;
vector<int> v[111111], ans;
int deep = -1;
void dfs(int x, int nowdeep)
{
    if (nowdeep > deep)
    {
        deep = nowdeep;
        ans.clear();
    }
    if (nowdeep == deep)
    {
        ans.push_back(x);
    }
    for (int i = 0; i < v[x].size(); i++)
    {
        dfs(v[x][i], nowdeep + 1);
    }
}
int main()
{
    int n, x, pos;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> x;
        if (x == -1)
        {
            pos = i;
        }
        else
            v[x].push_back(i);
    }
    dfs(pos, 1);
    int f = 0;
    cout << deep << endl;
    for (auto e : ans)
    {
        if (f == 0)
        {
            cout << e;
            f = 1;
        }
        else
            cout << " " << e;
    }
}