Submission #1379887

---

Source Code Expand

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

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)
typedef vector<int> Array;
typedef vector<Array> Graph;
Graph G(100005);
bool visit[100005];

int dfs(int now){
    if(visit[now]) return 0;
    visit[now] = true;
    int res = 1;
    REP(i, G[now].size()){
        if(!visit[G[now][i]]){
            res+=dfs(G[now][i]);
        }
    }
    return res;
}

int main(){
    int N;
    cin >> N;
    REP(i, N-1){
        int p;
        cin >> p;
        G[i+1].push_back(p);
        G[p].push_back(i+1);
    }
    REP(i, N){
        int res = 0;
        REP(j, N) visit[j] = false;
        visit[i] = true;
        REP(j, N){
            res = max(res, dfs(j));
        }
        cout << res << endl;
    }
    return 0;
}

Submission Info

Judge Result