题目链接:http://poj.org/problem?id=3984
源代码:
#include<iostream>
#include<algorithm>
using namespace std;
struct node{
int x,y;
}path[25],way[25];
int ans=1<<30;
int dfsmap[5][5];
int dirx[4]={1,-1,0,0};
int diry[4]={0,0,1,-1};
void dfs(node cur,int deep){
if(cur.x==4&&cur.y==4&&ans>deep){
ans=deep;
for(int i=0;i<deep;i++)
{
way[i].x=path[i].x;
way[i].y=path[i].y;
}
way[deep].x=4;
way[deep].y=4;
return ;
}
for(int i=0;i<4;i++){
node v;
v.x=cur.x+dirx[i];
v.y=cur.y+diry[i];
if(v.x<0||v.x>4||v.y<0||v.y>4)
continue;
if(dfsmap[v.x][v.y]==0)
{
dfsmap[v.x][v.y]=1;
path[deep].x=cur.x;
path[deep].y=cur.y;
dfs(v,deep+1);
dfsmap[v.x][v.y]=0;
}
}
}
int main(){
for(int i=0;i<5;i++)
for(int j=0;j<5;j++)
cin>>dfsmap[i][j];
node cur;cur.x=0,cur.y=0;
dfs(cur,0);
for(int i=0;i<=ans;i++)
cout<<"("<<way[i].x<<", "<<way[i].y<<")"<<endl;
return 0;
}