POJ2386水洼dfs

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include<vector>
#include<string.h>
#include<map>
#include<cmath>
#include<queue>
#define ll long long
#define INF 0x7fffffff
#define MAX 0x3f3f3f3f
#define maxn 100005
#define mem(a) memset(a,0,sizeof(a))
#define ull unsigned long long
using namespace std;

int n,m,ans;
char f[105][105];

void dfs(int x,int y){
    f[x][y]='.';
    for(int dx=-1;dx<=1;dx++){
        for(int dy=-1;dy<=1;dy++){
            int xx=x+dx,yy=y+dy;//环绕一周的坐标
            if(xx>=0&&xx<n&&yy>=0&&yy<m&&f[xx][yy]=='W') dfs(xx,yy);
        }
    }
    return;
}

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