Submission #1530582

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
using namespace std;

int main()
{
    int N;
    cin >> N;
    vector<int> B(N);
    vector<vector<int> > children(N, vector<int>());
    for (int i = 1; i < N; i++) {
        cin >> B[i];
        B[i]--;
        children[B[i]].push_back(i);
    }

    vector<long long> salary(N, 1);
    for (int i = N - 1; i >= 0; i--) {
        if (children[i].size() == 0)
            continue;

        long long min_salary = INT_MAX, max_salary = INT_MIN;
        for (int c : children[i]) {
            min_salary = min(min_salary, salary[c]);
            max_salary = max(max_salary, salary[c]);
        }
        salary[i] = min_salary + max_salary + 1;
    }
    cout << salary[0] << endl;
}

Submission Info

Judge Result