连通块个数---E - Lake Counting_lakee counting-CSDN博客

本文链接：https://blog.csdn.net/ur_ytii/article/details/113870820

这篇博客介绍了一个关于如何计算农田中积水区域（池塘）数量的问题。给定一个表示农田的矩形网格，其中包含水（'W'）和干燥土地（'.'），每个单元格可以与其八个相邻单元格相邻。通过深度优先搜索算法遍历所有相连的水单元格，确定了三个池塘的位置：左上角、右下角和右侧。代码实现了这一算法并输出了积水池塘的数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water ('W') or dry land ('.'). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors.

Given a diagram of Farmer John's field, determine how many ponds he has.

Input

* Line 1: Two space-separated integers: N and M

* Lines 2..N+1: M characters per line representing one row of Farmer John's field. Each character is either 'W' or '.'. The characters do not have spaces between them.

Output

* Line 1: The number of ponds in Farmer John's field.

Sample Input

10 12
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.

Sample Output

Hint

OUTPUT DETAILS:

There are three ponds: one in the upper left, one in the lower left,and one along the right side.

AC代码：

#include<cstdio>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#pragma warning(disable:4996)
using namespace std;
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
const int maxn = 200 + 10;
const int INF = 0x7fffffff;
char g[maxn][maxn];
int book[maxn][maxn];
int n, m;
int pos_x[8] = { -1,0,1,1,1,0,-1,-1 }, pos_y[8] = { -1,-1,-1,0,1,1,1,0 };
void dfs(int y, int x) {
	book[y][x] = 1;
	//printf("x:%d y:%d\n", x, y);
	for (int i = 0; i < 8; i++) {
		if (x + pos_x[i] >= 0 && x + pos_x[i] < m&&y + pos_y[i] >= 0 && y + pos_y[i] < n
			&&g[y + pos_y[i]][x + pos_x[i]] == 'W'&&book[y + pos_y[i]][x + pos_x[i]] == 0) {
			dfs(y + pos_y[i], x + pos_x[i]);
		}
	}
}
int dfstrave() {
	int sum = 0;
	for(int i=0;i<n;i++)
		for(int j=0;j<m;j++)
			if (book[i][j] == 0 && g[i][j] == 'W') {
				sum++;
				//printf("**i:%d j:%d\n", i, j);
				dfs(i, j);
			}
	return sum;
}
int main() {
	while (scanf("%d %d", &n, &m) != EOF) {
		getchar();
		memset(book, 0, sizeof(book));
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++)
				scanf("%c", &g[i][j]);
			getchar();
		}
		printf("%d\n", dfstrave());
	}
	return 0;
}