图论__最小生成树
shuangde800
这个作者很懒,什么都没留下…
展开
-
HDU 3938 Portal(离线+Kruskal+并查集)
链接:http://acm.hdu.edu.cn/showproblem.php?pid=3938题目:Problem DescriptionZLGG found a magic theory that the bigger banana the bigger banana peel .This important theory can help him m原创 2012-09-10 14:29:16 · 1743 阅读 · 0 评论 -
UVa 10099 - The Tourist Guide(Floyd, 最大生成树)
链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1040题目:Problem DThe Tourist GuideInput: standard inputOutput: standard原创 2012-09-18 00:08:13 · 1354 阅读 · 0 评论 -
UVa 10048 - Audiophobia(Floyd, Kruskal)
链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=989题目: Problem B: Audiophobia Consider yourself lucky原创 2012-09-18 00:04:53 · 2850 阅读 · 0 评论 -
UVa 10034 - Freckles (最小生成树模板题)
链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=975题目:Problem A: FrecklesIn an episode of the Dick Van Dyke show, litt原创 2012-09-16 14:03:40 · 2099 阅读 · 1 评论 -
HDU 4081 Qin Shi Huang's National Road System (次小生成树算法)
链接:http://acm.hdu.edu.cn/showproblem.php?pid=4081题目:Problem DescriptionDuring the Warring States Period of ancient China(476 BC to 221 BC), there were seven kingdoms in China ----原创 2012-09-16 00:42:58 · 6448 阅读 · 0 评论 -
UVa 10369 - Arctic Network(求最小生成树的第k小边)
链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1310题目:Problem C: Arctic NetworkThe Department of National Defence (DND) w原创 2012-09-17 00:03:38 · 2962 阅读 · 0 评论 -
UVa 10397 - Connect the Campus (最小生成树)
链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1338题目:Problem EConnect the CampusInput: standard inputOutput: standar原创 2012-09-16 14:04:55 · 1997 阅读 · 0 评论 -
poj 1639 Picnic Planning(最小度限制生成树)
链接:http://poj.org/problem?id=1639题目:Picnic PlanningTime Limit: 5000MS Memory Limit: 10000KTotal Submissions: 7780 Accepted: 2726DescriptionThe C原创 2012-10-04 12:27:47 · 2503 阅读 · 0 评论 -
poj 2728 Desert King(最优比率生成树)
链接:http://poj.org/problem?id=2728题目:Desert KingTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 16802 Accepted: 4732DescriptionDavid th原创 2012-10-03 19:03:10 · 1953 阅读 · 0 评论 -
poj 1679 The Unique MST(次小生成树)
链接:http://poj.org/problem?id=1679题目:DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a conne原创 2012-09-28 17:27:05 · 1469 阅读 · 0 评论 -
poj 3522 Slim Span(枚举+最小生成树)
链接:http://poj.org/problem?id=3522题目:Slim SpanTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 4962 Accepted: 2587DescriptionGiven an原创 2012-09-28 20:22:00 · 1310 阅读 · 0 评论 -
HDU 1598 find the most comfortable road (枚举+Kruskal)
链接:http://acm.hdu.edu.cn/showproblem.php?pid=1598题目:Problem DescriptionXX星有许多城市,城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure---超级空中漫游结构)进行交流,每条SARS都对行驶在上面的Flycar限制了固定的Speed,同时XX星人对原创 2012-09-10 00:06:54 · 4660 阅读 · 2 评论 -
HDU 3367 Pseudoforest (伪森林)
链接:http://acm.hdu.edu.cn/showproblem.php?pid=3367题目:Problem DescriptionIn graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cyc原创 2012-09-11 00:13:15 · 1524 阅读 · 0 评论 -
HDU 2489 Minimal Ratio Tree (DFS枚举+最小生成树Prim)
链接:HDU : http://acm.hdu.edu.cn/showproblem.php?pid=2489POJ : http://poj.org/problem?id=3925题目:Problem DescriptionFor a tree, which nodes and edges are all weighted, the ratio of原创 2012-09-11 00:12:28 · 2920 阅读 · 16 评论 -
UVa 567 - Risk (Floyd)
链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=508题目: Risk Risk is a board game in which sever原创 2012-09-17 16:24:05 · 1392 阅读 · 0 评论