poj2386Lake Counting(dfs)

Lake Counting

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 25434		Accepted: 12814

Description

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.

Source

USACO 2004 November

题目大意：统计一个图中湖的个数，'W'表示水，与其相邻的八个方向若仍有'W',则认为它们是同一片水域；

如例图中共有3个湖；

解题思路：每次找到一个W就遍历其八个方向，直到搜不到W,搜索的过程不断将W标记为点；这样的搜索能进行几次；说明就有几片水域。

AC代码:

#include<stdio.h>
#include<string.h>
char map[110][110];
int n,m;
void dfs(int x,int y)
{
	if(x<0||x>=n||y<0||y>=m||map[x][y]=='.')
	 return ;
	map[x][y]='.';
	dfs(x-1,y);
	dfs(x+1,y);
	dfs(x,y-1);
	dfs(x,y+1);
	dfs(x+1,y+1);
	dfs(x+1,y-1);
	dfs(x-1,y+1);
	dfs(x-1,y-1);
}
int main()
{
	int i,j,k;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		memset(map,0,sizeof(map));
		for(i=0;i<n;i++)
		{
			getchar();
			scanf("%s",map[i]);
		}
		int cnt=0;
		for(i=0;i<n;i++)
		{
			for(j=0;j<m;j++)
			{
				if(map[i][j]=='W')
				{
					dfs(i,j);
					cnt++;
				}
			}
		}
	printf("%d\n",cnt);
	}
return 0;
}