Submission #1139279

---

Source Code Expand

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

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;

#define INF INT_MAX/3

#define MAX_N 1000

int n;
vector<int> g[111111];
int ans[111111];

int dfs(int v,int pre){
  int dsum=0;
  int res=-INF;
  rep(i,g[v].size()){
    if(g[v][i]==pre)continue;
    int s=dfs(g[v][i],v);
    dsum+=s;
    maxch(res,s);
  }
  maxch(res,n-1-dsum);
  ans[v]=res;
  return dsum+1;
}

int main(){
	cin.sync_with_stdio(false);
  cin>>n;
  rep(i,n-1){
    int c;
    cin>>c;
    g[i+1].pb(c);
    g[c].pb(i+1);
  }
  dfs(0,-1);
  rep(i,n)cout<<ans[i]<<endl;
	return 0;
}

Submission Info

Judge Result