|시간 제한||메모리 제한||제출||정답||맞힌 사람||정답 비율|
|2 초||512 MB||181||46||43||25.000%|
Farmer John's farm consists of $N$ pastures ($2 \leq N \leq 10^5$) connected by $N-1$ roads, so that any pasture is reachable from any other pasture. That is, the farm is a tree. But after 28 years of dealing with the tricky algorithmic problems that inevitably arise from trees, FJ has decided that a farm in the shape of a tree is just too complex. He believes that algorithmic problems are simpler on paths.
Thus, his plan is to partition the set of roads into several paths and delegate responsibility for these path among his worthy farm hands. He doesn't care about the number of paths. However, he wants to make sure that these paths are all as large as possible, so that no farm hand can get away with asymptotically inefficient algorithms!
Help Farmer John determine the largest positive integer $K$ such that the roads can be partitioned into paths of length at least $K$.
The first line contains a single integer $N$.
The next $N-1$ lines each contain two space-separated integers $a$ and $b$ describing an edge between vertices $a$ and $b$. Both $a$ and $b$ are in the range $1 \ldots N$.
8 1 2 1 3 1 4 4 5 1 6 6 7 7 8
One possible set of paths is as follows: $$2-1-6-7-8, 3-1-4-5$$