题意:
给定一棵树,要求删去K条边,使得分离出的各个子树中,最大的直径最小。
n<=10^5
Host by is-Programmer.com | Power by Chito 1.3.3 beta | Theme: Aeros 2.0 by TheBuckmaker.com