Submission #1231119

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
#include <deque>

using namespace std;

#define mod 1000000007

vector<vector<int> > graph(100001);
int result[100001];
int parent[100001];
int n;

void getparent(int k)
{
	for(int i = 0; i < graph[k].size(); i++){
		int next = graph[k][i];
		if(parent[next] >= 0 || next == 0) continue;
		parent[next] = k;
		getparent(next);
	}
}

int getresult(int k)
{
	if(result[k] >= 0) return result[k];
	result[k] = 0;
	for(int i = 0; i < graph[k].size(); i++){
		int next = graph[k][i];
		if(next == parent[k]) continue;
		result[k] += getresult(next) + 1;
	}
	return result[k];
}

int solve(int k)
{
	int sum = 0;
	int ans = 0;
	for(int i = 0; i < graph[k].size(); i++){
		int next = graph[k][i];
		if(next == parent[k]) continue;
		int tmp = getresult(next);
		ans = max(ans, tmp + 1);
		sum += tmp + 1;
	}
	// cout << k << " " << sum << endl;
	ans = max(ans, n - sum - 1);
	return ans;
}

int main()
{
	cin >> n;
	for(int i = 0; i < n; i++){
		result[i] = -1;
		parent[i] = -1;
	}
	for(int i = 1; i <= n - 1; i++){
		int p;
		cin >> p;
		graph[i].push_back(p);
		graph[p].push_back(i);
	}
	getparent(0);
	for(int i = 0; i < n; i++){
		// cout << i << " " << getresult(i) << endl;
		cout << solve(i) << endl;
	}
	return 0;
}

Submission Info

Judge Result