POJ--2386 Lake Counting

Lake Counting

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 26483		Accepted: 13307

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.


很简单的一道DFS题，水题一个，以下是我的AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char f[105][105];
int n,m;
void DFS(int x,int y)
{
	int nx,ny,dx,dy;
	f[x][y]='.';
	for(dx=-1;dx<=1;dx++)
	{
		for(dy=-1;dy<=1;dy++)
		{
			nx=x+dx;ny=y+dy;
			if(0<=nx&&nx<n&&0<=ny&&ny<m&&f[nx][ny]=='W')
			DFS(nx,ny);
		}
	}
}
int main()
{
	//freopen("input.in","r",stdin);
	while(cin>>n>>m)
	{
		memset(f,0,sizeof(f));
		for(int i=0;i<n;i++)
		{
			scanf("%s",&f[i]); 
		}
		/*for(int i=0;i<n;i++)
		{
			puts(f[i]);
			cout<<endl;
		}*/
		int cal=0;
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<m;j++)
			{
				if(f[i][j]=='W')
				{
					DFS(i,j);
					cal++;
				}
			}
		}
		cout<<cal<<endl;
	}
	return 0;
 }