白皮书&&黑白图像

深搜模板题~~~

#include<iostream>
#include<string.h>
#include<string>
#define N 100
using namespace std;
int map[N][N];
void dfs(int x,int y)
{
	if(!map[x][y]||map[x][y]==-1) return;
	  map[x][y]=-1;
	dfs(x-1,y+1);dfs(x-1,y);dfs(x-1,y-1);
	dfs(x,y+1);       dfs(x,y-1);
	dfs(x+1,y+1);dfs(x+1,y-1);dfs(x+1,y);
}
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		memset(map,0,sizeof(map));
		int n;
		cin>>n;
		string s;
		for(int i=0;i<n;++i)
		{
			cin>>s;
			for(int j=0;j<n;++j)
				map[i+1][j+1]=s[j]-'0';
	    }
		int count=0;
		for(int i=1;i<=n;++i)
			for(int j=1;j<=n;++j)
				if(map[i][j]==1) {count++;dfs(i,j);}
				cout<<count<<endl;
	}return 0;
}