Lake Counting/POJ 2386/DFS

Lake Counting/POJ 2386/DFS

题目

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.

题目来源：POJ 2386
题目链接

题意

给定n*m的矩阵，矩阵上有‘W’，和‘.’。'W’就代表该格上是水，要求找出有多少个水池。水池即是水的联通块，一格水在另一格水周围（8个方向）则这两格水联通。

解法

简单的搜索，直接搜就完事了，我用的是DFS。

代码：

#include <cstring>
#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <iostream>
using namespace std;
int dx[8]={1,-1,0,0,-1,-1,1,1};
int dy[8]={0,0,1,-1,-1,1,-1,1};
int n,m,ans,a[110][110];
bool f[110][110];
char st[110];
void dfs(int x,int y) 
{
	if (x<1 || x>n || y<1 || y>m) return ;
	if (a[x][y]==1 || f[x][y]) return; 
	f[x][y]=true;
	for (int i=0;i<8;i++) dfs(x+dx[i],y+dy[i]);
}
int main()
{
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++) 
	{
		scanf("%s",st);
		for (int j=0;j<m;j++) if (st[j]=='.') a[i][j+1]=1; else a[i][j+1]=0;
	}
	for(int i=1;i<=n;i++)
	for(int j=1;j<=m;j++) 
	{
		if (a[i][j]==0 && !f[i][j]) 
		{
			dfs(i,j);
			ans++;
		}
	}
	printf("%d",ans);
	return 0;
}