摘要: 1103 - Castle Walls PDF (English) Statistics ForumTime Limit: 2 second(s) Memory Limit: 64 MBIn medieval times, knights commanded big armies of p... 阅读全文
posted @ 2013-03-27 22:08 SCAU_Xxm 阅读(205) 评论(0) 推荐(0)
摘要: 1112 - Curious Robin HoodPDF (English)StatisticsForumTime Limit:1 second(s)Memory Limit:64 MBRobin Hood likes to loot rich people since he helps the p... 阅读全文
posted @ 2013-03-27 18:56 SCAU_Xxm 阅读(263) 评论(0) 推荐(0)
摘要: 1047 - Neighbor HousePDF (English)StatisticsForumTime Limit:0.5 second(s)Memory Limit:32 MBThe people of Mohammadpur have decided to paint each of the... 阅读全文
posted @ 2013-03-26 22:16 SCAU_Xxm 阅读(305) 评论(0) 推荐(0)
摘要: 全裸的费用流,用来试模版的。费用流:在有代价与容量约束的网络上,安排一定的流量,使得所安排流量的费用或者代价达到最小,就是所谓的最小费用流问题。如果所安排的流量为网络的最大流,则称为最小费用最大流。求解最小费用流有两种经典算法,这里介绍一种增广路法。主要思想是,从流量为零开始,不断选择增广路,增加流... 阅读全文
posted @ 2013-03-24 13:28 SCAU_Xxm 阅读(214) 评论(0) 推荐(0)