Submission #1074508

---

Source Code Expand

#include<iostream>
#include<cctype>
#include<vector>
#include<ctype.h>
#include<algorithm>
#include<queue>
#include<string>
#include<math.h>
#include<iomanip>
using namespace std;
int n, m; vector<long long> a;
int main() {
	cin >> n;
	for (size_t i = 0; i < n + 1; i++)
	{
		a.push_back(0);
	}
	for (size_t i = 2; i < n+1; i++)
	{
		cin >> m;
		a[m]++;
		a[i]++;
		a[m] = max(a[m], a[i]);
		a[i] = max(a[m], a[i]);

	}
	sort(a.begin(), a.end());
	cout << *(a.end()-1)<<endl;
	return 0;
}

Submission Info

Judge Result