poj-【2386 Lake Counting】

Lake Counting

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 31206		Accepted: 15583

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

#include
int n,m;
char map[120][120];
void dfs(int nx,int ny)
{
	map[nx][ny]='.';
	int i,j;
	for(i=-1;i<=1;++i)
	{
		for(j=-1;j<=1;++j)
		{
			int dx=nx+i;
			int dy=ny+j;
			if(dx>=0&&dx=0&&dy