2013年10月10日
hdu 三部曲 A Knight's Journey 简单dfs（），顺序很重要（字典序），搜索顺序的先后体现
摘要： Problem DescriptionBackgroundThe knight is getting bored of seeing the same black and white squares again and again and has decided to make a journeyaround the world. Whenever a knight moves, it is two squares in one direction and one square perpendicular to this. The world of a knight is the chessb 阅读全文
posted @ 2013-10-10 21:18 persistent codeants 阅读(321) 评论(0) 推荐(0)
Paratroopers 最大流问题 dinic算法 水平有待提高
摘要： Problem DescriptionIt is year 2500 A.D. and there is a terrible war between the forces of the Earth and the Mars. Recently, the commanders of the Earth are informed by their spies that the invaders of Mars want to land some paratroopers in them×ngrid yard of one their main weapon factories in o 阅读全文
posted @ 2013-10-10 19:03 persistent codeants 阅读(318) 评论(0) 推荐(0)