Lake Counting（POJ - 2386）

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

3

Hint
OUTPUT DETAILS:

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

#include<stdio.h>
#include<string.h>
char a[110][110];
int m, n;
void dfs(int x, int y)
{
	a[x][y] = '.';//将这个已经积水的地方替换为干旱的
	int x2, y2;
	//检查已积水的八个方向是否还有积水的地方
	for(int i=-1; i<=1; i++)
		for (int j = -1; j <= 1; j++)
		{
			x2 = x + i, y2 = y + j;
			if (x2 > 0 && x2 <= n && y2 > 0 && y2 <= m && a[x2][y2] == 'W')//如果还有积水的地并在院子内
			{
				dfs(x2, y2);//从这个积水点再此深搜
			}
		}
	return;
}
int main()
{
	int sum = 0;
	scanf("%d%d", &n, &m);
	getchar();//读取缓存中的回车键，以防被当做字符输入
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
			scanf("%c",&a[i][j]);
		getchar();
	}
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
		{
			if (a[i][j] == 'W')
			{
				dfs(i, j);//从有积水的地方开始深搜
				sum++;//记录水洼的个数
			}
		}
	printf("%d", sum);
}