POJ 1861 && ZOJ 1542--Network 【最小生成树 && kruscal && 水题】

最新推荐文章于 2022-04-04 16:23:42 发布

阿阿阿阿_欢

最新推荐文章于 2022-04-04 16:23:42 发布

阅读量949

点赞数

分类专栏：最小生成树 POJ ZOJ

本文链接：https://blog.youkuaiyun.com/hpuhjh/article/details/47401027

版权

该博客讲述了如何解决一个网络连接问题，目标是找到一个网络连接方案，使得所有节点间都能通过连接路径到达，同时单条电缆的最大长度最小。问题转化为寻找最小生成树，给出输入输出样例，并强调最大边应为所有生成树中最小的。解决方案是构建最小生成树。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Network

Time Limit: 2 Seconds Memory Limit: 65536 KB Special Judge

Andrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since each worker of the company must have access to the whole network, each hub must be accessible by cables from any other hub (with possibly some intermediate hubs).

Since cables of different types are available and shorter ones are cheaper, it is necessary to make such a plan of hub connection, that the maximum length of a single cable is minimal. There is another problem - not each hub can be connected to any other one because of compatibility problems and building geometry limitations. Of

最低0.47元/天解锁文章