Submission #1774722

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

struct Edge
{
    int nxt, to;
} e[100010];
int head[100010], cnt;

void add_edge(int a, int b)
{
    e[++cnt] = (Edge) { head[a], b };
    head[a] = cnt;
}

int dfs(int nod, int tata)
{
    vector <int> fii;
    for (int i(head[nod]); i; i = e[i].nxt)
        fii.push_back(dfs(e[i].to, nod));
    sort(fii.rbegin(), fii.rend());

    int dmax(0);
    for (int i(0); i < fii.size(); i++)
        dmax = max(dmax, i + 1 + fii[i]);

    return dmax;
}

int main()
{
    int n, x;
    cin >> n;

    for (int i(2); i <= n; i++) {
        cin >> x;
        add_edge(x, i);
    }

    cout << dfs(1, 0);
    return 0;
}

Submission Info

Judge Result