CF622E.Ants in Leaves
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Tree is a connected graph without cycles. A leaf of a tree is any vertex connected with exactly one other vertex.
You are given a tree with n vertices and a root in the vertex 1 . There is an ant in each leaf of the tree. In one second some ants can simultaneously go to the parent vertex from the vertex they were in. No two ants can be in the same vertex simultaneously except for the root of the tree.
Find the minimal time required for all ants to be in the root of the tree. Note that at start the ants are only in the leaves of the tree.
输入格式
The first line contains integer n ( 2<=n<=5⋅105 ) — the number of vertices in the tree.
Each of the next n−1 lines contains two integers xi,yi ( 1<=xi,yi<=n ) — the ends of the i -th edge. It is guaranteed that you are given the correct undirected tree.
输出格式
Print the only integer t — the minimal time required for all ants to be in the root of the tree.
输入输出样例
输入#1
12 1 2 1 3 1 4 2 5 2 6 3 7 3 8 3 9 8 10 8 11 8 12
输出#1
6
输入#2
2 2 1
输出#2
1