ninteresting 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. 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.
A new city has just been built. There're n n interesting places numbered by positive numbers from 1 1 to n n. In order to save resources, only exactly n-1 n−1 roads are built to connect these n n 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 x_1,x_2 ldots x_k x 1 ,x 2 …x k 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.)
标签： HBC51121旅游 图论 最短路meeting题解
