2014年4月28日
求全局最小割（SW算法）
摘要： hdu3002King of DestructionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1022Accepted Submission(... 阅读全文
posted @ 2014-04-28 10:46 一样菜 阅读(504) 评论(0) 推荐(0)
求割边最小的最小割
摘要： hdu3987Harry Potter notices some Death Eaters try to slip into Castle. The Death Eaters hide in the most depths of Forbidden Forest. Harry need stop t... 阅读全文
posted @ 2014-04-28 10:41 一样菜 阅读(444) 评论(0) 推荐(0)
最大流最小割的综合运用
摘要： hdu3820Golden EggsTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 367Accepted Submission(s): 208Pr... 阅读全文
posted @ 2014-04-28 10:31 一样菜 阅读(384) 评论(0) 推荐(0)
最大流最小割（最大点权独立集）
摘要： hdu3657GameTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 832Accepted Submission(s): 351Problem D... 阅读全文
posted @ 2014-04-28 10:17 一样菜 阅读(279) 评论(0) 推荐(0)