2015年8月10日
POJ 1466 Girls and Boys(最大独立集)
摘要： Description：In the second year of the university somebody started a study on the romantic relations between the students. The relation "romantically i... 阅读全文
posted @ 2015-08-10 20:00 搁浅の记忆 阅读(179) 评论(0) 推荐(0)
HDU 1045 Fire Net（缩点求最大匹配）
摘要： Problem Description：Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each repres... 阅读全文
posted @ 2015-08-10 17:56 搁浅の记忆 阅读(148) 评论(0) 推荐(0)
POJ 2195 Going Home(BFS+KM求最小权值)
摘要： Description：On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or ver... 阅读全文
posted @ 2015-08-10 15:56 搁浅の记忆 阅读(321) 评论(0) 推荐(0)