2015年8月12日
HDU 2819 Swap（记录二分匹配的过程）
摘要： Problem Description：Given an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make all ... 阅读全文
posted @ 2015-08-12 20:24 搁浅の记忆 阅读(170) 评论(0) 推荐(0) 编辑
POJ 1273 Drainage Ditches（网络流模板）
摘要： Description：Every 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 wa... 阅读全文
posted @ 2015-08-12 15:24 搁浅の记忆 阅读(144) 评论(0) 推荐(0) 编辑