POJ1258 Agri-Net中英对照翻译与参考解答

千凡

于 2020-03-08 18:50:24 发布

阅读量456

点赞数 1

分类专栏：数据结构与算法文章标签：算法 acm竞赛

本文链接：https://blog.csdn.net/zhaozigu123/article/details/104737920

版权

该博客介绍了如何利用Prim算法解决POJ1258题目的农业网络连接问题，即在连接所有农场的最小光纤成本。文章提供了问题背景、输入输出说明，并给出了算法解析及参考代码。

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

POJ1258 Agri-Net

传送门： POJ1258
关键词： 图；Prim

Description

Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.
Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.

农夫John被选为他所在市的市长！而他的竞选承诺之一是将在该地区的所有的农场用互联网连接起来。当然，他现在需要你的帮助。John的农场已经连上高速连接的互联网，现在他要将这一连接与其他农场分享。为了减少成本，他希望用最短长度的光纤将他的农场与其它农场连接起来。

Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
The distance between any two farms will not exceed 100,000.

给出连接任意两个农场所需要的光纤长度的列表，请你找到将所有农场连接一起所需要光纤的最短长度。每个农场必须和其它的农场相连，以便数据包可以从任何一个农场流向其它任意农场。任何两个农场之间的距离不超过100, 000米。

Input

The input includes several cases. For each case, the first line contains the number of farms, N (3 <= N <= 100). The following lines contain the N x N conectivity matrix, where each element shows the distance from on farm to another. Logically, they are N lines of N space-separated integers. Physically, they are limited in length to 80 characters, so some lines continue onto others. Of course, the diagonal will be 0, since the distance from farm i to itself is not interesting for this problem.

输入包含若干组测试用例。每组测试用例的第一行给出农场数目N (3 <= N <= 100)。然后是N x N的邻接矩阵，其每个元素表示一个农场与另一个农场之间的距离。给出N行，每行有N个空格间隔的整数。一行接着一行地输入，每行不超过80个字符。当然，矩阵的对角线为0，因为每个农场到自己的距离为0。