poj2386 Lake Counting【DFS】

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
const int maxn = 105;
int dx[] = {0,1,-1,0,-1,1,-1,1};
int dy[] = {1,0,0,-1,-1,1,1,-1};
char mapple[maxn][maxn];
int vis[maxn][maxn];
int n,m;
void dfs(int x,int y)
{
for(int i=0;i<8;i++)
{
int tx = x + dx[i];
int ty = y + dy[i];
if(tx<0 || ty<0 || tx>=n || ty>=m)
continue;
if(mapple[tx][ty]=='.' || vis[tx][ty])
continue;
vis[tx][ty] = 1;
dfs(tx,ty);
}
}
int main(void)
{
scanf("%d %d",&n,&m);
for(int i=0;i<n;i++)
scanf("%s",mapple[i]);
memset(vis,0,sizeof(vis));
int ans = 0;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(mapple[i][j]=='W' && !vis[i][j])
{
ans++;
vis[i][j]=1;
dfs(i,j);
}
}
}
printf("%d\n",ans);
return 0;
}