直接看代码吧
#include<iostream>
#include<vector>
using namespace std;
const int N=1e5+5;
vector<int> son[N];
int n,res,t,fa;//res是辈分,fa是祖宗
vector<int> ans;
void dfs1(int u,int num)
{
//cout<<u<<" "<<num<<"\n";//这一行可以输出来debug
if (son[u].size()==0) {
if (res<num) res=num;
return;
}
for (int i=0;i<son[u].size();i++)
{
dfs1(son[u][i],num+1);
}
}
void dfs2(int u,int num)
{
if (num==res) {
ans.push_back(u);
return;
}
for (int i=0;i<son[u].size();i++)
{
dfs2(son[u][i],num+1);
}
}
int main()
{
cin>>n;
for (int i=1;i<=n;i++)
{
cin>>t;
if (t==-1) {
fa=i;
continue;
}
son[t].push_back(i);
}
dfs1(fa,1);
dfs2(fa,1);
cout<<res<<"\n";
for (int i=0;i<ans.size();i++)
{
if (i!=0) cout<<" ";
cout<<ans[i];
}
}