POJ 2631Roads in the North【树的直径】【模板题】

最新推荐文章于 2022-07-04 13:10:52 发布

ssss圆

最新推荐文章于 2022-07-04 13:10:52 发布

阅读量450

点赞数

分类专栏：树的直径

本文链接：https://blog.csdn.net/tingtingyuan/article/details/81412483

版权

该问题描述了一个包含多个村庄和道路的北极区域，每个村庄都可以通过不重复经过其他村庄的道路到达任何其他村庄。给定村庄和道路的信息，任务是找到区域内两个最偏远村庄之间的道路距离。输入包含村庄之间的道路及其长度，输出为这两个村庄间最远的距离。

摘要由CSDN通过智能技术生成

POJ 2631:Roads in the North

总时间限制:

1000ms

内存限制:

65536kB

描述

Building and maintaining roads among communities in the far North is an expensive business. With this in mind, the roads are build such that there is only one route from a village to a village that does not pass through some other village twice.
Given is an area in the far North comprising a number of villages and roads among them such that any village can be reached by road from any other village. Your job is to find the road distance between the two most remote villages in the area.

The area has up to 10,000 villages connected by road segments. The villages are numbered from 1.

输入

Input to the problem is a sequence of lines, each containing three positive integers: the number of a village, the number of a different village, and the length of t