Submission #1367933

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define rrep(i,n) for(int i=(int)(n)-1; i>=0; i--)
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin(); it!=(c).end(); it++)
#define pb(a) push_back(a)
#define pr(a) cout << (a) << endl
#define PR(a,b) cout << (a) << " " << (b) << endl
#define F first
#define S second
typedef long long ll;
typedef pair<int,int> P;
const int MAX=1000000001;
const ll MAXL=1000000000000000001LL;
const ll mod=1000000007;
int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
 
vector<P> v[100001];
 
int solve(int i,int p) {
  if(v[i].size()==1) return 1;
  int sum=0;
  rep(j,v[i].size()) {
    if(v[i][j].F!=p) {
      if(v[i][j].S==0) {
	v[i][j].S=solve(v[i][j].F,i);
	sum+=v[i][j].S;
      } else sum+=v[i][j].S;
    }
  }
  return sum+1;
}
 
int main() {
  int n;
  cin >> n;
  rep(i,n-1) {
    int x;
    cin >> x;
    v[i+1].pb(P(x,0));
    v[x].pb(P(i+1,0));
  }
  rep(i,n) {
    int ans=0;
    if(v[i].size()==1) pr(n-1);
    else {
      rep(j,v[i].size()) {
	if(v[i][j].S==0) ans=max(ans,solve(v[i][j].F,i));
	else ans=max(ans,v[i][j].S);
      }
      pr(ans);
    }
  }
  return 0;
}

Submission Info

Judge Result