Submission #1692444

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#define vvi vector<vector<int>>
#define vi vector<int>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int INF = 10e7;
vvi v;
int dfs(int a) {
  if (v[a].size() == 0) {
    return 1;
  }
  int macs = -INF, mini = INF;
  rep(i, v[a].size()) {
    int money = dfs(v[a][i]);
    macs = max(macs, money);
    mini = min(mini, money);
  }
  return mini + macs + 1;
}

int main() {
  int n;
  cin >> n;
  v = vvi(n);
  int b;
  rep(i, n - 1) {
    cin >> b;
    b--;
    v[b].push_back(i + 1);
  }
  cout << dfs(0) << endl;

  return 0;
}

Submission Info

Judge Result