随笔分类 -  最小生成树

POJ 3026 Borg Maze (最小生成树 + BFS)
摘要：Borg MazeTime Limit:1000MSMemory Limit:65536KTotal Submissions:6804Accepted:2293DescriptionThe Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group consciousness of the Borg civilization. Each Borg 阅读全文
posted @ 2013-07-17 23:07 Jack Ge 阅读(539) 评论(0) 推荐(0) 编辑
POJ 3522 Slim Span
摘要：Slim SpanTime Limit:5000MSMemory Limit:65536KTotal Submissions:5362Accepted:2813DescriptionGiven an undirected weighted graphG, you should find one of spanning trees specified as follows.The graphGis an ordered pair (V,E), whereVis a set of vertices {v1,v2, …,vn} andEis a set of undirected edges {e1 阅读全文
posted @ 2013-05-13 15:01 Jack Ge 阅读(1256) 评论(0) 推荐(0) 编辑
POJ 3164 Command Network (最小树形图)
摘要：Command NetworkTime Limit:1000MSMemory Limit:131072KTotal Submissions:10136Accepted:2946DescriptionAfter a long lasting war on words, a war on arms finally breaks out between littleken’s and KnuthOcean’s kingdoms. A sudden and violent assault by KnuthOcean’s force has rendered a total failure of lit 阅读全文
posted @ 2013-05-13 14:41 Jack Ge 阅读(272) 评论(0) 推荐(0) 编辑
POJ 2728 Desert King （最优比例生成树)
摘要：Desert KingTime Limit:3000MSMemory Limit:65536KTotal Submissions:17772Accepted:5011DescriptionDavid the Great has just become the king of a desert country. To win the respect of his people, he decided to build channels all over his country to bring water to every village. Villages which are connecte 阅读全文
posted @ 2013-05-12 10:37 Jack Ge 阅读(754) 评论(0) 推荐(0) 编辑
POJ 1639 Picnic Planning （度限制生成树）
摘要：Picnic PlanningTime Limit:5000MSMemory Limit:10000KTotal Submissions:8340Accepted:2946DescriptionThe Contortion Brothers are a famous set of circus clowns, known worldwide for their incredible ability to cram an unlimited number of themselves into even the smallest vehicle. During the off-season, th 阅读全文
posted @ 2013-05-12 08:18 Jack Ge 阅读(1754) 评论(0) 推荐(0) 编辑
POJ 1679 The Unique MST
摘要：The Unique MSTTime Limit:1000MSMemory Limit:10000KTotal Submissions:16690Accepted:5782DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique.Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of G, s 阅读全文
posted @ 2013-05-01 15:05 Jack Ge 阅读(505) 评论(0) 推荐(0) 编辑
POJ 1861 Network （Kruskal）
摘要：NetworkTime Limit:1000MSMemory Limit:30000KTotal Submissions:11372Accepted:4337Special JudgeDescriptionAndrew 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 eac 阅读全文
posted @ 2013-04-17 21:52 Jack Ge 阅读(461) 评论(0) 推荐(0) 编辑
POJ 3723 Conscription （最大生成树）
摘要：ConscriptionTime Limit:1000MSMemory Limit:65536KTotal Submissions:5995Accepted:2058DescriptionWindy has a country, and he wants to build an army to protect his country. He has picked upNgirls andMboys and wants to collect them to be his soldiers. To collect a soldier without any privilege, he must p 阅读全文
posted @ 2013-04-17 21:32 Jack Ge 阅读(364) 评论(0) 推荐(0) 编辑
HDU 1102 Constructing Roads(两种基本方法：Prim | Kruskal）
摘要：Constructing RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9149 Accepted Submission(s): 3383 Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect 阅读全文
posted @ 2012-12-18 17:44 Jack Ge 阅读(3796) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示