摘要:
转自:http://www.cppblog.com/mythit/archive/2009/04/19/80470.html最近又复习了下最大流问题,每次看这部分的内容都会有新的收获。可以说最大流问题的资料网上一搜一大把,根本没有必要自己写;但是大部分资料上的专业术语太多了,初学很难理解,至少我当年... 阅读全文
摘要:
无题IITime Limit: 2000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 571Accepted Submission(s): 296Problem Descript... 阅读全文
摘要:
汉诺塔IXTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 437Accepted Submission(s): 250Problem Descrip... 阅读全文
摘要:
Cat VS DogTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1728Accepted Submission(s): 581Problem ... 阅读全文
摘要:
转自:http://www.cnblogs.com/celia01/archive/2012/04/02/2430260.html除了准备离散考试外,算是第一次仔细学习图论和网络流的相关知识了。以前只知道用最大二分匹配的模板,今天就把理论知识好好总结一下,以免以后忘记。从网上搜罗了一些知识,有一下几... 阅读全文
摘要:
转自:http://www.cnblogs.com/pushing-my-way/archive/2012/08/05/2624271.htmlspfa:1.当给定的图存在负权边时,Dijkstra等算法便没有了用武之地,而Bellman-Ford算法的复杂度又过高,SPFA算法便派上用场了.2.我... 阅读全文
摘要:
过山车Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5139Accepted Submission(s): 2260Problem Descrip... 阅读全文