2019牛客多校赛第四场 A题 树直径

链接：https://ac.nowcoder.com/acm/contest/884/A
来源：牛客网
 

题目描述

A new city has just been built. There're n interesting places numbered by positive numbers from 1 to nnn.

In order to save resources, only exactly n−1 roads are built to connect these nnn interesting places. Each road connects two places and it takes 1 second to travel between the endpoints of any road.

There is one person in each of the places numbered x1,x2…xk​ and they've decided to meet at one place to have a meal. They wonder what's the minimal time needed for them to meet in such a place. (The time required is the maximum time for each person to get to that place.)

输入描述:

First line two positive integers, n,k - the number of places and persons.

For each the followingn−1 lines, there're two integers a,b that stand for a road connecting place a and b.