2013年3月3日
hdu 1598 find the most comfortable road(枚举+并查集)
摘要： find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1864Accepted Submission(s): 779Problem DescriptionXX星有许多城市，城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure---超级空中漫游结构）进行交流，每条SARS都对行驶在上面的Flycar限制了固定的Speed，同时XX星人对 Flycar的“舒适 阅读全文
posted @ 2013-03-03 21:14 剑不飞 阅读(139) 评论(0) 推荐(0)
hdu 1856 More is better(并查集)
摘要： More is betterTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 8057Accepted Submission(s): 3001Problem DescriptionMr Wang wants some boys to help him with a project. Because the project is rather complex,the more boys come, the better it will be. 阅读全文
posted @ 2013-03-03 20:27 剑不飞 阅读(118) 评论(0) 推荐(0)
poj 2112 Optimal Milking(最大费用流+dinic算法+二分搜索)
摘要： Optimal MilkingTime Limit:2000MSMemory Limit:30000KTotal Submissions:9253Accepted:3341Case Time Limit:1000MSDescriptionFJ has moved his K (1 15, a row is broken into successive lines of 15 numbers and a potentially shorter line to finish up a row. Each new row begins on its own line.OutputA single . 阅读全文
posted @ 2013-03-03 17:53 剑不飞 阅读(261) 评论(0) 推荐(0)
poj 1273 Drainage Ditches(最大费用流+最短增广路径算法)
摘要： Drainage DitchesTime Limit:1000MSMemory Limit:10000KTotal Submissions:45239Accepted:17002DescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. 阅读全文
posted @ 2013-03-03 14:05 剑不飞 阅读(213) 评论(0) 推荐(0)
poj 1149 PIGS(网络流+最大费用流+ford)
摘要： PIGSTime Limit:1000MSMemory Limit:10000KTotal Submissions:13190Accepted:5843DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse because he doesn't have the keys. Customers come to the farm one after another. Each of them has keys to s 阅读全文
posted @ 2013-03-03 12:07 剑不飞 阅读(141) 评论(0) 推荐(0)