# Lake Counting poj2836（深搜水题）

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

#include<iostream>
using namespace std;
int N,M;
const int Max_N=101;
const int Max_M=101;
char field[Max_N][Max_M];
void dfs(int x,int y){
field[x][y]='.';//将现在所在位置替换为'.'
for(int dx=-1;dx<=1;dx++)//循环遍历连通的8个方向
for(int dy=-1;dy<=1;dy++){
int nx=x+dx,ny=y+dy;//向x方向移动dx,向y方向移动dy,移动的结果为(nx,ny)
if(0<=nx&&nx<N&&0<=ny&&ny<M&&field[nx][ny]=='W')
dfs(nx,ny);
}
return;
}
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
dfs(i,j);
res++;
}
}
cout<<res<<endl;
}
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;
}