本题思路取自他人,我加以修改以及添加一点自己的理解;
链接:https://blog.csdn.net/BWbear0412/article/details/75911812?utm_source=app
代码如下:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cstdlib>
#include <algorithm>
using namespace std;
int x[105][105];
int y[105][105]; //标记数组
int z[4][2]={{0,1},{1,0},{-1,0},{0,-1}};
int n,i,j;
int a,b,c; //坐标,以及该点之前所花时间
int bfs()
{
queue < int >s1;
a=b=c=0;
s1.push(a);
s1.push(b);
s1.push(c);
y[a][b]=1;
while(!s1.empty())
{
a = s1.front();
s1.pop();
b = s1.front();
s1.pop();
c = s1.front();
s1.pop();
if(a==n-1&&b==n-1)
return c+x[a][b];
if(x[a][b]>1) //记录某一个点所花时间,
{
s1.push(a);
s1.push(b);
s1.push(c+1);
x[a][b]--;
continue;
}
for(i=0;i<4;i++)
{
int x1=z[i][0]+a;
int y1=z[i][1]+b;
if(x1<n&&x1>=0&&y1<n&&y1>=0&&y[x1][y1]==0&&x[x1][y1]!=0)
{
s1.push(x1);
s1.push(y1);
s1.push(c+1); //为了与0区别,故分开计算
y[x1][y1]=1;
}
}
}
return -1;
}
int main()
{
while(scanf("%d",&n)!=EOF)
{
memset(y,0,sizeof(y));
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf("%d",&x[i][j]);
int ans=bfs();
printf("min=%d\n",ans);
}
return 0;
}