这题是找最多走过了格数，可以用dfs const z:array[1..4,1..2]of -1..1=((0,1),(0,-1),(1,0),(-1,0));//呀，方便啊var i,j,k,x,y:longint;m,n,max:longint;a:array[0..200,0..200]of 0..2;//记录所用的表格s:string;procedure dfs(x,y,fx,sum