最近DFS真的做烦了。
。。感觉剪枝条件写的还行
import java.util.ArrayList;
import java.util.Scanner;
class Node{
int var;
boolean isleftvisit=false;
boolean isupvisit=false;
boolean isrightvisit=false;
boolean isdownvisit=false;
int nowsum=0;
}
public class Main {
public static int bestw=0;
public static boolean isInMap(int x,int y,int m,int n)
{
if(x>=0&&x<=m-1&&y>=0&&y<=n-1)
{
return true;
}
return false;
}
public static void DFS(int i,int j,Node[][] map,int m,int n,int sum)
{
if(!isInMap(i,j,m,n))
{
return;
}
if(map[i][j].var==0)
{
sum=map[i][j].nowsum+1+sum;
if(sum>bestw)
bestw=sum;
map[i][j].nowsum=sum;
}
if(isInMap(i+1,j,m,n)&&!map[i+1][j].isupvisit)
{
map[i+1][j].isupvisit=true;
DFS(i+1,j,map,m,n,map[i][j].nowsum);
}
if(isInMap(i,j+1,m,n)&&!map[i][j+1].isleftvisit)
{
map[i][j+1].isleftvisit=true;
DFS(i,j+1,map,m,n,map[i][j].nowsum);
}
if(isInMap(i-1,j,m,n)&&!map[i-1][j].isdownvisit)
{
map[i-1][j].isdownvisit=true;
DFS(i-1,j,map,m,n,map[i][j].nowsum);
}
if(isInMap(i,j-1,m,n)&&!map[i][j-1].isrightvisit)
{
map[i][j-1].isrightvisit=true;
DFS(i,j-1,map,m,n,map[i][j].nowsum);
}
return;
}
public static void main(String[] args)
{
Scanner sca=new Scanner(System.in);
int m=sca.nextInt();
int n=sca.nextInt();
Node[][] Map=new Node[m][n];
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
Map[i][j]=new Node();
Map[i][j].var=sca.nextInt();
}
}
Map[0][0].isdownvisit=true;
Map[0][0].isrightvisit=true;
DFS(0,0,Map,m,n,Map[0][0].nowsum);
System.out.println(bestw);
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
System.out.println(Map[i][j].nowsum);
}
}
}
}
。。感觉剪枝条件写的还行