POJ1944--Fiber Communications

最新推荐文章于 2019-06-12 23:18:29 发布

RTD

最新推荐文章于 2019-06-12 23:18:29 发布

阅读量326

点赞数

分类专栏： POJ

本文链接：https://blog.csdn.net/m0_37685982/article/details/78974889

版权

奶牛场主Farmer John想要用光纤网络连接他的N个谷仓，但只能连接相邻的谷仓。给定需要通信的谷仓对，目标是确定最少需要建立多少条连接。输入包含谷仓数量N和通信对数P，输出最小连接数。样例输入显示了5个谷仓和2对通信需求，输出为3，意味着需要连接1-2、2-3和4-5。

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

题目来源：http://poj.org/problem?id=1944
题目内容：
Fiber Communications
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 4728 Accepted: 1412
Description

Farmer John wants to connect his N (1 <= N <= 1,000) barns (numbered 1..N) with a new fiber-optic network. However, the barns are located in a circle around the edge of a large pond, so he can only connect pairs of adjacent barns. The circular configuration means that barn N is adjacent to barn 1.

FJ doesn’t need to connect all the barns, though, since only certain pairs of cows wish to communicate with each other. He wants to construct as few
connections as possible while still enabling all of these pairs to communicate through the network. Given the list of barns that wish to communicate with each other, determine the minimum number of lines that must be laid. To communicate fr