2013年10月14日
Dungeon Master 和上题基本相同 bfs(),求最优值 不同的是三维bfs(),存储有技巧 (u=x*r*c+y*c+z);
摘要： Problem DescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit north, south, east, west, up or down. You cannot move diagonally and the maze is surrounded b 阅读全文
posted @ 2013-10-14 21:42 persistent codeants 阅读(232) 评论(0) 推荐(0)
Children of the Candy Corn 深搜 广搜 很经典 对queue的认识又增加一份
摘要： Problem DescriptionThe cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopaths, hippies, and other terrors on their quest to find the exit.One popular maze-walking strategy guarantees that the visitor 阅读全文
posted @ 2013-10-14 19:58 persistent codeants 阅读(204) 评论(0) 推荐(0)