水沟问题

M - Lake Counting

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

 

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.

#include<stdio.h>
#include<string.h>
char s[105];
int map[105][105],vis[105][105];
int cur=0,n,m;
void DFS(int i,int j)
{
	if(vis[i][j] || !map[i][j]) return; //map[i][j]!='W'或者已经标记过，跳出
	vis[i][j]=1;
	DFS(i-1,j-1);DFS(i-1,j);DFS(i-1,j+1);
	DFS(i,j-1);							//要是注释了这两行就wa了
							DFS(i,j+1);
	DFS(i+1,j-1);DFS(i+1,j);DFS(i+1,j+1);	
}
int main()
{
	int i,j;
	memset(vis,0,sizeof(vis));
	memset(map,0,sizeof(map));
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++){
		scanf("%s",s);
		for(j=0;j<m;j++)
			if(s[j]=='W') map[i][j+1]=1;
			else map[i][j+1]=0;
	}
	for(i=1;i<=n;i++)
		for(j=1;j<=m;j++)
			if(map[i][j]==1 && !vis[i][j]){ cur++;DFS(i,j);} //条件写在这里，碰到没有标记的W便

进行递归
	printf("%d\n",cur);
	return 0;
}