G - dfs POJ - 2386

G - dfs 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.

翻译就是 四连通的图，求区域个数。
输入图形之后，遇到第一个“W“就dfs并把所有W都变成‘.’
这样在循环中，遇到一次W，就计数增加一次
注意不要数组越界，需要判断是否在界内

#include<stdio.h>
char a[110][110];
int m,n;
void dfs(int i,int j){
	int x,y;
	a[i][j]='.';
	for(x=-1;x<=1;x++)
		for(y=-1;y<=1;y++){
			if(a[i+x][j+y]=='W'&&i+x>=0&&j+y>=0&&i+x<m&&j+y<n) dfs(i+x,j+y);
		}
}
int main(){
	int i,j,t=0;
	scanf("%d%d",&m,&n);
	for(i=0;i<m;i++)
		scanf("%s",a[i]);
	for(i=0;i<m;i++)
		for(j=0;j<n;j++) 
			if(a[i][j]=='W')
				{dfs(i,j);
				t++;
				}
	printf("%d\n",t);
	return 0;
}