Submission #1676496

---

Source Code Expand

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000000000000000000000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)                                                                             
#define seg_size 524288
vector<long long> vertexs[200000];
long long dp[200000] = {};
int n;
long long solve(long long now, long long back) {
	long long cnt = 0;
	long long minnest = 0;
	for (int i = 0;i < vertexs[now].size();++i) {
		if (vertexs[now][i] != back) {
			long long as = solve(vertexs[now][i], now);
			minnest = max(minnest, as);
			cnt += as;
		}
	}
	minnest = max(minnest, n - 1 - cnt);
	dp[now] = minnest;
	cnt++;
	return cnt;
}
int main() {
	cin >> n;
	REP(i, n-1) {
		long long a;
		cin >> a;
		vertexs[a].push_back(i + 1);
		vertexs[i + 1].push_back(a);
	}
	solve(0, -1);
	for (int i = 0;i < n;++i) {
		cout << dp[i] << endl;
	}
	return 0;
}

Submission Info

Judge Result