Submission #3110602

---

Source Code Expand

#include <iostream>
#include <vector>
using namespace std;

int N,ans[100010] = {0},visited[100010] = {0},s[100010];
vector<vector<int>> v(100010);

void dfs(int n){
	visited[n] = 1;
	int sum = 0,ma = 0;
	for(int i=0;i<v[n].size();i++){
		if(visited[v[n][i]]==0){
			dfs(v[n][i]);
			s[n] += s[v[n][i]];
			ma = max(ma,s[v[n][i]]);
		}
	}
	ans[n] = max(ma,N-s[n]);
}

int main(){
	cin >> N;
	int p;
	s[0] = 1;
	for(int i=1;i<N;i++){
		cin >> p;
		v[i].push_back(p);
		v[p].push_back(i);
		s[i] = 1;
	}
	dfs(0);
	for(int i=0;i<N;i++){
		cout << ans[i] << endl;
	}
}

Submission Info

Judge Result