Submission #1437810

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <fstream>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include<iomanip>
#define sqr(x) (x)*(x)
#define ll long long
using namespace std;
int n,m,i,j,dp[100005],used[100005],x;
vector<int> bi[100005];
bool cmp(int x,int y)
{
	return dp[x]>dp[y];
}
void dfs(int x)
{
	used[x]=1;
	int i;
	vector<int> win;
	for (i=0;i<bi[x].size();i++)
	{
		if (!used[bi[x][i]]) dfs(bi[x][i]);
		win.push_back(bi[x][i]); 
	}
	sort(win.begin(),win.end(),cmp);
	for (i=0;i<bi[x].size();i++)
	{
		 dp[x]=max(dp[bi[x][i]]+i,dp[x]);
	}
	dp[x]++;
}
int main()
{
	cin>>n;
	for (i=2;i<=n;i++)
	{
		cin>>x;
		bi[x].push_back(i);
	}
	dfs(1);
	cout<<dp[1]-1;
	return 0;
}

Submission Info

Judge Result