题目链接：https://cn.vjudge.net/problem/POJ-1251
Description
The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes roads relentlessly, so the large road network is too expensive to maintain. The Council of Elders must choose to stop maintaining some roads. The map above on the left shows all the roads in use now and the cost in aacms per month to maintain them. Of course there needs to be some way to get between all the villages on maintained roads, even if the route is not as short as before. The Chief Elder would like to tell the Council of Elders what would be the smallest amount they could spend in aacms per month to maintain roads that would connect all the villages. The villages are labeled A through I in the maps above. The map on
本文介绍了一道POJ-1251编程题目，该题目要求使用Kruskal算法找出连接所有村庄的最低维护成本的路网。输入包含多个数据集，每个数据集描述了不同村庄之间的道路及其维护费用。输出为每组数据的最小维护成本。题目提供示例输入和输出，展示了如何在限制时间内找到解决方案。
最低0.47元/天 解锁文章
80
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
