随笔分类 -  ACM-Graph

上一页 1 2 3 4 下一页
最大流问题[转]
摘要：转自：http://www.cppblog.com/mythit/archive/2009/04/19/80470.html最近又复习了下最大流问题，每次看这部分的内容都会有新的收获。可以说最大流问题的资料网上一搜一大把，根本没有必要自己写；但是大部分资料上的专业术语太多了，初学很难理解，至少我当年... 阅读全文
posted @ 2012-08-14 17:15 max_xbw 阅读(293) 评论(0) 推荐(0)
HDOJ---2236 无题II[二分枚举+匈牙利]
摘要：无题IITime Limit: 2000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 571Accepted Submission(s): 296Problem Descript... 阅读全文
posted @ 2012-08-14 16:14 max_xbw 阅读(216) 评论(0) 推荐(0)
HDOJ---3829 Cat VS Dog[匈牙利]
摘要：Cat VS DogTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1728Accepted Submission(s): 581Problem ... 阅读全文
posted @ 2012-08-14 11:34 max_xbw 阅读(227) 评论(0) 推荐(0)
由二分图匹配匈牙利算法总结的一些知识[转]
摘要：转自：http://www.cnblogs.com/celia01/archive/2012/04/02/2430260.html除了准备离散考试外，算是第一次仔细学习图论和网络流的相关知识了。以前只知道用最大二分匹配的模板，今天就把理论知识好好总结一下，以免以后忘记。从网上搜罗了一些知识，有一下几... 阅读全文
posted @ 2012-08-14 09:49 max_xbw 阅读(283) 评论(0) 推荐(0)
spfa_队列
摘要：转自：http://www.cnblogs.com/pushing-my-way/archive/2012/08/05/2624271.htmlspfa:1.当给定的图存在负权边时，Dijkstra等算法便没有了用武之地，而Bellman-Ford算法的复杂度又过高，SPFA算法便派上用场了.2.我... 阅读全文
posted @ 2012-08-14 09:47 max_xbw 阅读(410) 评论(0) 推荐(0)
HDOJ---2036 过山车[匈牙利算法]
摘要：过山车Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5139Accepted Submission(s): 2260Problem Descrip... 阅读全文
posted @ 2012-08-14 00:02 max_xbw 阅读(219) 评论(0) 推荐(0)
HDOJ---1151 Air Raid[匈牙利算法：最小路径覆盖数=原图顶点数–二分图最大匹配数]
摘要：Air RaidTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1859Accepted Submission(s): 1191Problem De... 阅读全文
posted @ 2012-08-13 23:05 max_xbw 阅读(567) 评论(0) 推荐(0)
HDOJ---1856 More is better[并查集求节点最多的树的节点数量]
摘要：More is betterTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 6438Accepted Submission(s): 2383Pr... 阅读全文
posted @ 2012-08-12 17:23 max_xbw 阅读(359) 评论(0) 推荐(0)
HDOJ---1273 漫步森林[图论]
摘要：漫步森林Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1051Accepted Submission(s): 703Problem Descrip... 阅读全文
posted @ 2012-08-12 13:42 max_xbw 阅读(391) 评论(0) 推荐(0)
HDOJ---1217 Arbitrage[弗洛伊德算法]
摘要：ArbitrageTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2369Accepted Submission(s): 1082Problem D... 阅读全文
posted @ 2012-08-11 21:36 max_xbw 阅读(261) 评论(0) 推荐(0)
HDOJ---1863 畅通工程[Prim（）]
摘要：畅通工程Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9935Accepted Submission(s): 3916Problem Descri... 阅读全文
posted @ 2012-08-11 01:01 max_xbw 阅读(189) 评论(0) 推荐(0)
HDOJ---1102 Constructing Roads[Prim()]
摘要：Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7661Accepted Submission(s): 2861... 阅读全文
posted @ 2012-08-10 23:41 max_xbw 阅读(182) 评论(0) 推荐(0)
HDOJ---1142 A Walk Through the Forest[DFS（记忆化搜索）+Dijkstra]
摘要：A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3312Accepted Submission(s... 阅读全文
posted @ 2012-08-10 14:20 max_xbw 阅读(272) 评论(0) 推荐(0)
POJ ---2236 Wireless Network[简单并查集]
摘要：Wireless NetworkTime Limit: 10000MSMemory Limit: 65536KTotal Submissions: 12427Accepted: 5236DescriptionAn earthquake takes place in Southeast Asia. T... 阅读全文
posted @ 2012-08-10 10:58 max_xbw 阅读(210) 评论(0) 推荐(0)
POJ----1182 食物链[并查集]
摘要：食物链Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 30510Accepted: 8883Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动物，以1－N编... 阅读全文
posted @ 2012-08-09 22:43 max_xbw 阅读(198) 评论(0) 推荐(0)
POJ---2492 A Bug's Life[并查集]
摘要：A Bug's LifeTime Limit: 10000MSMemory Limit: 65536KTotal Submissions: 21679Accepted: 7071DescriptionBackground Professor Hopper is researching the sex... 阅读全文
posted @ 2012-08-09 20:46 max_xbw 阅读(332) 评论(0) 推荐(0)
并查集的基础知识
摘要：最近有学到一种更加通用的方法，因为它还适用于1182食物链中有三种集合相关联的情况，而且此法更为简洁。只需加一个rank数组，表示两种派别，值为0和1，初始化为0.查询时如果两人属于同一集合并且属于派别相同就输出In the same gang.否则输出In different gangs.不属于同... 阅读全文
posted @ 2012-08-09 12:10 max_xbw 阅读(151) 评论(0) 推荐(0)
POJ---2524 Ubiquitous Religions[简单并查集]
摘要：Ubiquitous ReligionsTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 17762Accepted: 8653DescriptionThere are so many different religions in th... 阅读全文
posted @ 2012-08-09 10:55 max_xbw 阅读(271) 评论(0) 推荐(0)
POJ---1611 The Suspects[并查集]
摘要：The SuspectsTime Limit: 1000MSMemory Limit: 20000KTotal Submissions: 15580Accepted: 7450DescriptionSevere acute respiratory syndrome (SARS), an atypic... 阅读全文
posted @ 2012-08-08 22:50 max_xbw 阅读(202) 评论(0) 推荐(0)
并查集的初级应用及进阶
摘要：转自：http://blog.csdn.net/pure_life/article/details/2922118一、精华精华提炼1： 内容：并查集就是树的孩子表示法的应用。 解释：对于下图所示树，它的孩子表示法为： belg[5]=2, belg[6]=2, belg[7]=2; belg[2... 阅读全文
posted @ 2012-08-08 22:03 max_xbw 阅读(240) 评论(0) 推荐(0)

上一页 1 2 3 4 下一页