Submission #3771760

---

Source Code Expand

#include <bits/stdc++.h>

#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;

int solve(int);
int n;
int a[22];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    cin>>n;
    for(int i=2;i<=n;i++){
        cin>>a[i];
    }
    cout << solve(1)<<endl;
    return 0;
}
int solve(int x){
    int niko=0,b=1e9;
    for(int i=1;i<=n;i++){
        if(a[i]==x){
            int maki=solve(i);
            niko=max(maki,niko);
            b=min(maki,b);
        }
    }
    if(niko==0&&b==1e9){
        return 1;
    }
    else{
        return niko+b+1;
    }
}

Submission Info

Judge Result