深度优先+奇偶剪枝 杭电1010
摘要：
#include<stdio.h>#include<math.h>char maze[8][8];int time, m, n, wall, sx, sy, dx, dy, escape;int dir[4][2] = {{0,-1},{0,1},{1,0},{-1,0}};void dfs(sx, sy, t){ int i, temp; if(sx > m || sy > n || sx <= 0 || sy <= 0) return ; if(sx == dx && sy == dy && t == time 阅读全文
posted @ 2013-03-10 12:54 于敬晖 阅读(872) 评论(0) 推荐(0) 编辑
