CF1039D.You Are Given a Tree

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

A tree is an undirected graph with exactly one simple path between each pair of vertices. We call a set of simple paths $k$ -valid if each vertex of the tree belongs to no more than one of these paths (including endpoints) and each path consists of exactly $k$ vertices.

You are given a tree with $n$ vertices. For each $k$ from $1$ to $n$ inclusive find what is the maximum possible size of a $k$ -valid set of simple paths.

输入格式

The first line of the input contains a single integer $n$ ( $2 \le n \le 100\,000$ ) — the number of vertices in the tree.

Then following $n - 1$ lines describe the tree, each of them contains two integers $v$ , $u$ ( $1 \le v, u \le n$ ) — endpoints of the corresponding edge.

It is guaranteed, that the given graph is a tree.

输出格式

Output $n$ numbers, the $i$ -th of which is the maximum possible number of paths in an $i$ -valid set of paths.

输入输出样例

输入#1

输出#1

输入#2
```
6
1 2
2 3
2 4
1 5
5 6
```
输出#2
```
6
2
2
1
1
0
```

说明/提示

One way to achieve the optimal number of paths for the second sample is illustrated in the following picture:

首页