task1 T3 fortress

印象深刻：

dfs复制到dfsII里面只改了函数名没有改函数内部进行递归的部分

惨案

注意选最优解是影响循环顺序的

#include<bits/stdc++.h>
using namespace std;
template <typename T> void read(T &x){
	x=0;int f=1;char ch=getchar();
	for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-1;
	for(;isdigit(ch);ch=getchar())x=x*10+ch-'0';
	x*=f;
}

int n,m;
int maz[55][55];
int sum,tot;
int maxs=-1,nowmax=-1; 
bool vis[55][55];
int ansx;
int ansy;
char func='E';

void dfs(int x,int y){
	++tot;
	if(tot>maxs) maxs=tot;
	vis[x][y]=1;
	//cout<<x<<" "<<y<<endl;
	if((maz[x][y]&1)==0){
		int nx=x,ny=y-1;
		if(nx>=1&&nx<=n&&ny>=1&&ny<=m&&!vis[nx][ny])dfs(nx,ny);
	}
	if((maz[x][y]&2)==0){
		int nx=x-1,ny=y;
		if(nx>=1&&nx<=n&&ny>=1&&ny<=m&&!vis[nx][ny])dfs(nx,ny);
	}
	if((maz[x][y]&4)==0){
		int nx=x,ny=y+1;
		if(nx>=1&&nx<=n&&ny>=1&&ny<=m&&!vis[nx][ny])dfs(nx,ny);
	}
	if((maz[x][y]&8)==0){
		int nx=x+1,ny=y;
		if(nx>=1&&nx<=n&&ny>=1&&ny<=m&&!vis[nx][ny])dfs(nx,ny);
	}
}

void dfsII(int x,int y){
	++tot;
	if(tot>nowmax) nowmax=tot;
	vis[x][y]=1;
	//cout<<x<<" "<<y<<endl;
	if((maz[x][y]&1)==0){
		int nx=x,ny=y-1;
		if(nx>=1&&nx<=n&&ny>=1&&ny<=m&&!vis[nx][ny])dfsII(nx,ny);
	}
	if((maz[x][y]&2)==0){
		int nx=x-1,ny=y;
		if(nx>=1&&nx<=n&&ny>=1&&ny<=m&&!vis[nx][ny])dfsII(nx,ny);
	}
	if((maz[x][y]&4)==0){
		int nx=x,ny=y+1;
		if(nx>=1&&nx<=n&&ny>=1&&ny<=m&&!vis[nx][ny])dfsII(nx,ny);
	}
	if((maz[x][y]&8)==0){
		int nx=x+1,ny=y;
		if(nx>=1&&nx<=n&&ny>=1&&ny<=m&&!vis[nx][ny])dfsII(nx,ny);
	}
}

void work(){
	/*for(int i=1;i<=n;++i)*/for(int j=1;j<=m;++j){
		/*for(int j=1;j<=m;++j)*/for(int i=n;i>=1;--i){
			if((maz[i][j]&2)==2){
				memset(vis,0,sizeof(vis));
				maz[i][j]-=2;
				tot=0;
				nowmax=-1;
				dfsII(i,j);
				maz[i][j]+=2;
				//cout<<tot<<" "<<maxs<<endl;
				if(nowmax>maxs){
					//cout<<i<<" "<<j<<endl;
					ansx=i;
					ansy=j;
					func='N';
					maxs=nowmax;
				}
			}
			//cout<<(maz[i][j]&4)<<" ";
			if((maz[i][j]&4)==4){
				//cout<<i<<" "<<j<<endl; 
				memset(vis,0,sizeof(vis));
				maz[i][j]-=4;
				tot=0;
				nowmax=-1;
				dfsII(i,j);
				maz[i][j]+=4;
				//cout<<tot<<" "<<maxs<<endl<<endl;
				if(nowmax>maxs){
					ansx=i;
					ansy=j;
					func='E';
					maxs=nowmax;
				}
			}
		}
	}
}

int main(){
	//freopen("fortress.in","r",stdin);
	//freopen("fortress.out","w",stdout);
	scanf("%d%d",&m,&n);
	for(int i=1;i<=n;++i)
		for(int j=1;j<=m;++j)
			read(maz[i][j]);
	for(int i=1;i<=n;++i)
		for(int j=1;j<=m;++j)
			if(!vis[i][j]){
				tot=0;
				dfs(i,j);
				++sum;
			}
	printf("%d\n%d\n",sum,maxs);
	work();
	printf("%d\n",maxs);
	cout<<ansx<<" "<<ansy<<" "<<func<<endl;
 	return 0;
}