poj2386 lake counting

早听闻拓扑与dfs密切相关，然而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.

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.

题目意思很简单，就是九宫格范围内的水坑都算作一个，dfs 深搜每一个水坑并扫描九宫格替换即可，常规题。

#include<bits/stdc++.h>
using namespace std;
#define MMAXR 101
#define MMAXC 101


char ways[MMAXR][MMAXC];
int dir[8][2]={{-1,0},{0,-1},{0,1},{1,0},{-1,1},{-1,-1},{1,-1},{1,1}};
int l,w;
bool check(int x,int y){
	if(x<l&&y<w&&x>=0&&y>=0)return true ;
	else return false;
}


void dfs(int dx,int dy){
	ways[dx][dy]='.';
	for (int i=0;i<8;i++){
		int nx=dx+dir[i][0];
		int ny=dy+dir[i][1];
		if(check(nx,ny)&&ways[nx][ny]=='W'){
			ways[nx][ny]='.';
			dfs(nx,ny);
		}
	}
	return ;	
	}
int main (){
   cin>>l>>w;
   int ans=0;
    for(int i=0;i<l;i++)
   for(int j=0;j<w;j++)
   cin>>ways[i][j];
   for(int i=0;i<l;i++){
  
   for(int j=0;j<w;j++){
   	if(ways[i][j]=='W'){dfs(i,j);
	   ans++;}
   	
   	
   }
	 }
	 cout<<ans<<endl;
}