2013年4月21日

POJ 1258 Agri-Net 克鲁斯卡尔(Kruskal)算法&并查集

摘要: J -Agri-NetTime Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uPOJ 1258DescriptionFarmer 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 阅读全文

posted @ 2013-04-21 20:38 圣手摘星 阅读(187) 评论(0) 推荐(0) 编辑

POJ 2421 Constructing Roads 克鲁斯卡尔(Kruskal)算法

摘要: F -Constructing RoadsTime Limit:2000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uPOJ 2421DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and 阅读全文

posted @ 2013-04-21 20:35 圣手摘星 阅读(230) 评论(0) 推荐(0) 编辑

最小生成树&并查集POJ 1287 Networking

摘要: 最小生成树的简单运用E -NetworkingTime Limit:1000MSMemory Limit:10000KB64bit IO Format:%I64d & %I64uPOJ 1287DescriptionYou are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connec 阅读全文

posted @ 2013-04-21 20:28 圣手摘星 阅读(138) 评论(0) 推荐(0) 编辑

最小生成树&并查集 POJ 1861 Network

摘要: B -NetworkTime Limit:1000MSMemory Limit:30000KB64bit IO Format:%I64d & %I64uPOJ 1861DescriptionAndrew 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 wo 阅读全文

posted @ 2013-04-21 20:23 圣手摘星 阅读(159) 评论(0) 推荐(0) 编辑

最小生成树 ZOJ 1203 Swordfish

摘要: 1203 SwordfishA -SwordfishTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%lld & %lluZOJ 1203There exists a world within our worldA world beneath what we call cyberspace.A world protected by firewalls,passwords and the most advancedsecurity systems.In this world we hideour deepest secrets,o 阅读全文

posted @ 2013-04-21 20:06 圣手摘星 阅读(268) 评论(2) 推荐(0) 编辑

导航