水题,直接代码!
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<stdlib.h>
#define MAX_N 101
#define MAX_M 101
using namespace std;
int N, M;
char field[MAX_N][MAX_M];
void dfs(int x, int y)
{
field[x][y] = '.';
for (int dx = -1; dx <=1; dx++)
for (int dy = -1; dy <= 1; dy++)
{
int nx = x + dx, ny = y + dy;
if (nx >= 0 && nx < N && ny >= 0 && ny < M && field[nx][ny] == 'W')dfs(nx, ny);
}
return;
}
int main()
{
cin >> N >> M;
for(int i=0; i<N;i++)
for (int j = 0; j < M; j++)
cin >> field[i][j];
int ans = 0;
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
if (field[i][j] == 'W')
{
dfs(i, j);
ans++;
}
cout << ans;
system("pause");
}