|
;
if(s==n*m)
{
k=1;
if(key==0)
{
for(j=0;j<=n*m-1;j++)
{
path1[j]=prepath1[j];
path2[j]=prepath2[j];
}
key=1;
}else
{
change=-1;
for(j=0;j<=n*m-1;j++)
{
if(path1[j]>prepath1[j])
{
change=1;
break;
}else if(path1[j]
{
change=0;
break;
}else
{
if(path2[j]>prepath2[j])
{
change=1;
break;
}else if(path2[j]
{
change=0;
break;
}
}
}
if(change==1)
{
for(j=0;j<=n*m-1;j++)
{
path1[j]=prepath1[j];
path2[j]=prepath2[j];
}
}
}
}else
{
dfs(xend,yend);
}
s--; top--;
status[xend][yend]=0;
}
}
}
|