水题,计算八连通的水洼的数量,很明显应该用DFS。将在每趟中已遍历到的积水部分变为'.'直到该趟中所有位置都不能改变位置,统计趟数(调用DFS函数的次数)即可。
#include<iostream>
using namespace std;
const int Max = 103;
char field[Max][Max];
int n, m;
void DFS(int x, int y) {
//替换
field[x][y] = '.';
//8个方向
for (int dx = -1;dx <= 1;dx++) {
for (int dy = -1;dy <= 1;dy++) {
int nx = x + dx, ny = y + dy;
//判断是否在区域内及有效
if (nx >= 0 && ny >= 0 && nx < n&&ny < m&&field[nx][ny] == 'W') {
DFS(nx, ny);
}
}
}
return;
}
void solve() {
int count = 0;
for (int i = 0;i < n;i++) {
for (int j = 0;j < m;j++) {
if (field[i][j] == 'W') {
DFS(i, j);
count++;
}
}
}
cout << count << endl;
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0;i<n;i++) {
for (int j = 0;j<m;j++) {
cin >> field[i][j];
}
}
solve();
return 0;
}