poj 2386 Lake Counting

#include<cstdio>
#include<cstring>

const int N=110;
int n,m,ans;
char f

;
bool flag

;

void dfs(int i,int j)
{
if(i<0 || j<0 || i>=n ||j>=m) return;
if(flag[i][j] || f[i][j]=='.') return;
flag[i][j]=1;
dfs(i-1,j-1);
dfs(i-1,j);
dfs(i-1,j+1);
dfs(i,j-1);
dfs(i,j+1);
dfs(i+1,j-1);
dfs(i+1,j);
dfs(i+1,j+1);
}

int main()
{
while(~scanf("%d%d",&n,&m))
{
memset(flag,0,sizeof(flag));
int i,j;
ans=0;
for(i=0;i<n;i++) scanf("%s",f[i]);
for(i=0;i<n;i++)
for(j=0;j<m;j++)
if(!flag[i][j] && f[i][j]=='W')
{
ans++;
dfs(i,j);
//printf("%d %d %d\n",i,j,ans);
}
printf("%d\n",ans);
}
}