#include

struct lo

{

int x,y;

}answer[25]={},zhan[25]={};

int map[7][7]={},m,n,to=0,max=0;

void dfs(int x,int y)

{

zhan[to].x=x;

zhan[to].y=y;

to++;//进栈

map[x][y]=0;

if(map[x-1][y])dfs(x-1,y);

if(map[x][y-1])dfs(x,y-1);

if(map[x][y+1])dfs(x,y+1);

if(map[x+1][y])dfs(x+1,y);

if(to>max)

{

int i=0;

for(i=0;i