Language: C++

#include <iostream>
#include <string>
#include <utility>
#include <stack>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <climits>
#include <set>
#include <cmath>
#include <numeric>

using namespace std;

vector <int> edges[100000];
vector <int> reverse_edges[100000];
int in_degree[100000];
vector <int> tp_ord;
bool used[100000];
int dp[100000];
void dfs(int cur){
    used[cur] = true;
    for(int i = 0; i < edges[cur].size(); i++){
        int next = edges[cur][i];
        if(!used[next]){
            dfs(next);
        }
    }
    tp_ord.push_back(cur);
}

int main(){
    int N;
    cin >> N;
    for(int i = 0; i < N - 1; i++){
        int a;
        cin >> a;
        edges[i + 1].push_back(a - 1);
        reverse_edges[a - 1].push_back(i + 1);
        in_degree[a - 1] ++;
    }

    for(int i = 0; i < N; i++){
        if(in_degree[i] == 0){
            dfs(i);
        }
    }
    reverse(tp_ord.begin(), tp_ord.end());
    for(int i = 0; i < N; i++){
        int cur = tp_ord[i];
        int max_depth = 0;
        int min_depth = INT_MAX;
        for(int j = 0; j < reverse_edges[cur].size(); j++){
            max_depth = max(max_depth, 1 + dp[reverse_edges[cur][j]]);
            min_depth = min(min_depth, 1 + dp[reverse_edges[cur][j]]);
        }
        dp[cur] = min(max_depth, min_depth + reverse_edges[cur].size() - 1);

        //cout << cur << " " << dp[cur] << endl;
    }
    cout << dp[0] << endl;
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:58:22: error: no matching function for call to 'min(int&, std::vector<int>::size_type)'
   58 |         dp[cur] = min(max_depth, min_depth + reverse_edges[cur].size() - 1);
      |                   ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/string:51,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:233:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  233 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:233:5: note:   template argument deduction/substitution failed:
a.cc:58:22: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'std::vector<int>::size_type' {aka 'long unsigned int'})
   58 |         dp[cur] = min(max_depth, min_depth + reverse_edges[cur].size() - 1);
      |                   ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  281 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61,
                 from a.cc:7:
/usr/include/c++/14/bits/stl_algo.h:5686:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(initializer_list<_Tp>)'
 5686 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5686:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5696:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(initializer_list<_Tp>, _Compare)'
 5696 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5696:5: note:   template argument deduction/substitution failed:
a.cc:58:22: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   58 |         dp[cur] = min(max_depth, min_depth + reverse_edges[cur].size() - 1);
      |                   ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~