深搜
容易出bug的地方:
1. 数组开char
2. 行列对应的是n和m,别都写成n
C++ 代码
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1010;
int n, m;
char g[N][N];
int dx[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy[] = {1, -1, 1, 0, -1, -1, 0, 1};
void dfs(int x, int y)
{
g[x][y] = '.';
for (int i=0; i<8; i++)
{
int a = x + dx[i];
int b = y + dy[i];
if (a >= 0 && a < n && b >= 0 && b < m && g[a][b] == 'W')
{
dfs(a, b);
}
}
}
int main ()
{
cin >> n >> m;
for (int i=0; i<n; i++)
for (int j=0; j<m; j++)
cin >> g[i][j];
int res = 0;
for (int i=0; i<n; i++)
{
for (int j=0; j<m; j++)
{
if (g[i][j] == 'W')
{
res++;
dfs(i, j);
}
}
}
cout << res;
return 0;
}