Submission #3487965

---

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;
int n,m,b[10000][10000],total,x[4]={0,1,0,-1},y[4]={1,0,-1,0},maxx;
int dfs(int,int);
int main()
{
	cin>>n>>m;
    for(int i=1;i<=n;++i)
      for(int j=1;j<=m;++j)
        cin>>b[i][j];
    dfs(1,1);
    cout<<maxx;
    return 0;
}
int dfs(int k,int p)
{
	for(int i=0;i<=3;++i)
	{
		if(b[k][p]==1 && k+x[i]>=1&&k+x[i]<=n&&p+y[i]>=1&&p+y[i]<=m) 
		{
			total=0;
			dfs(k+x[i],p+y[i]);	
		}
		else
		{
			total++;
			if(total>maxx) maxx=total;
			b[k][p]=0;
			if(k+x[i]>=1&&k+x[i]<=n&&p+y[i]>=1&&p+y[i]<=m) dfs(k+x[i],p+y[i]);
		}
	}
}

Submission Info

Judge Result