关于递归还是要多练练

填涂颜色 - 洛谷

#include<iostream>
using namespace std;
#define int long long
#define IOS std::ios::sync_with_stdio;cin.tie(0);cin.tie(0);
int n,m;
const int MAX=31;
int f[MAX][MAX];
int dx[4]={1,-1,0,0},dy[4]={0,0,1,-1};
int vis[MAX][MAX];
void dfs(int x,int y){//位置标记 
	if(x<0||x>n+1||y<0||y>n+1||vis[x][y]!=0)return  ;
	for(int i=0;i<=3;i++){
		vis[x][y]=1;
		dfs(x+dx[i],y+dy[i]);
	}
}
signed main(){
	IOS;
	cin>>n;
	//m=n;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cin>>f[i][j];
			if(f[i][j]==0)vis[i][j]=0;
			else vis[i][j]=2;
		}
	} 
	dfs(0,0);//搜索从0开始搜索，边界感满满的 
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(vis[i][j]==0)cout<<2<<" ";
			else cout<<f[i][j]<<" "	;
		}
		cout<<"\n";
	}
	return 0;
}