摘要: Antenna PlacementTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5645Accepted: 2825DescriptionThe Global Aerial Research Centre has been allotted the task of building the fifth generation of ... 阅读全文
posted @ 2013-09-06 23:15 码代码的猿猿 阅读(148) 评论(0) 推荐(0) 编辑
摘要: Milking CowsThree farmers rise at 5 am each morning and head for the barn to milk three cows. The first farmer begins milking his cow at time 300 (measured in seconds after 5 am) and ends at time 1000... 阅读全文
posted @ 2013-09-06 07:34 码代码的猿猿 阅读(284) 评论(0) 推荐(0) 编辑
摘要: 最小点覆盖数==最大匹配数AsteroidsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 12678Accepted: 6904DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of ... 阅读全文
posted @ 2013-09-06 00:03 码代码的猿猿 阅读(124) 评论(0) 推荐(0) 编辑
摘要: 二分图最大匹配的K?nig定理及其证明 本文将是这一系列里最短的一篇,因为我只打算把K?nig定理证了,其它的废话一概没有。 以下五个问题我可能会在以后的文章里说,如果你现在很想知道的话,网上去找找答案: 1. 什么是二分图; 2. 什么是二分图的匹配; 3. 什么是匈牙利算法;(http://www.matrix67.com/blog/article.asp?id... 阅读全文
posted @ 2013-09-06 00:01 码代码的猿猿 阅读(282) 评论(0) 推荐(0) 编辑