Submission #1172211

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef set<int> si;
const int inf = 1e9;
const int mod = 1e9+7;

int N, ans[100000];
vi mp[100000];
si y;
int search(int pos){
  y.insert(pos);
  int ret = 1, bal = 0, d;
  for(vi::iterator itr = mp[pos].begin(); itr != mp[pos].end(); itr++){
    if(y.find(*itr) == y.end()){
      d = search(*itr);
      ret += d;
      bal = max(bal, d);
    }
  }
  ans[pos] = max(bal, N - ret);
  return ret;
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> N;
  int p;
  FOR(i, 1, N){
    cin >> p;
    mp[i].pb(p);
    mp[p].pb(i);
  }
  search(0);
  FOR(i, 0, N) cout << ans[i] << endl;
}

Submission Info

Judge Result