POJ.2386 Lake Counting

Lake Counting

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.

思路

此题类似求连通块问题，即一个方块是否和上下左右等8个方向是否连通，用dfs进行检查并替换，即可达到目的。

Sample input

10 12

Sample output

3

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int MAX_N=100;
int N,M;
char field[MAX_N][MAX_N+1];
void dfs(int x,int y)
{
	field[x][y]='.';
	for(int dx=-1;dx<=1;dx++){
		for(int dy=-1;dy<=1;dy++){
			int nx=x+dx,ny=y+dy;
			if(0<=nx&&nx<N&&0<=ny&&ny<M&&field[nx][ny]=='W')
			dfs(nx,ny);
		}
	} 
}
void solve()
{
	int res=0;
	for(int i=0;i<N;i++){
		for(int j=0;j<M;j++){
			if(field[i][j]=='W'){
			dfs(i,j);
			res++;
			}
		}
	}
	cout<<res;
}
int main()
{

	cin>>N>>M;
	for(int i=0;i<N;i++)
		for(int j=0;j<M;j++)
			cin>>field[i][j];
	solve();
	return 0;
 }