简单的dfs(刘汝佳的入门经典黑白图问题)
#include<iostream>
#include<algorithm>
using namespace std;
int mat[105][105];
bool vis[105][105];
int n,m;
void dfs(int x,int y){
if(mat[x][y]&&!vis[x][y]){
vis[x][y]=1;
for(int i=1;i<=2;i++){
dfs(x+i,y);dfs(x-i,y);}
for(int j=1;j<=2;j++)
{dfs(x,y+j);dfs(x,y-j);}
}
}
int main(){
freopen("rr.txt","r",stdin);
freopen("out.txt","w",stdout);
while(scanf("%d%d",&m,&n),m,n){
memset(mat,0,sizeof(mat));
memset(vis,0,sizeof(vis));
char c[105];
for(int i=0;i<m;i++){
scanf("%s",c);
for(int j=0;j<n;j++){
if(c[j]=='*')
mat[i+2][j+2]=1;
else if(c[j]=='+')
mat[i+2][j+2]=0;}
}
int count=0;
for(int i=2;i<=m+1;i++)
for(int j=2;j<=n+1;j++)
if(!vis[i][j]&&mat[i][j])
{count++;dfs(i,j);}
cout<<count<<endl;
}
return 0;}