# 1.题目原文

Lake Counting
 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 30088 Accepted: 15038

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

Hint

OUTPUT DETAILS:

There are three ponds: one in the upper left, one in the lower left,and one along the right side.

Source

# 3.AC代码

#include <iostream>
#include<cstdio>
using namespace std;
#define maxn 105
char field[maxn][maxn];
int n,m;
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;
//判断(nx,ny)是否在园子里，以及是否有积水
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++;
}
}
}
printf("%d\n",res);
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>field[i][j];
}
}
solve();
return 0;
}

# 4.类似题目：

#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define maxn 25
char field[maxn][maxn];
bool mark[maxn][maxn];
int n,m;
int res;
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
void dfs(int x,int y)
{
res++;
mark[x][y]=true;
//循环遍历八个方向
for(int i=0;i<4;i++){
int nx=x+dx[i],ny=y+dy[i];
if(0<=nx&&nx<n&&0<=ny&&ny<m&&field[nx][ny]=='.'&&!mark[nx][ny]){
//mark[x][y]=true;
dfs(nx,ny);
}
}
}
void solve()
{
int sx,sy;
memset(mark,0,sizeof(mark));
res=0;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(field[i][j]=='@'){
sx=i;
sy=j;
}
}
}
mark[sx][sy]=true;
dfs(sx,sy);
printf("%d\n",res);
}
int main()
{
while(cin>>m>>n){
if(n==0&&m==0) break;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>field[i][j];
}
}
solve();
}
return 0;
}

#### POJ2386-简单BFS/DFS

2016-09-15 10:51:44

#### poj 2386（深搜或广搜）

2014-03-07 16:51:44

#### poj2386

2014-11-15 15:03:46

#### POJ-2386-Lake Counting-解题报告

2011-01-22 19:02:00

#### 简单dfs--poj2386

2013-09-12 14:57:36

#### POJ2386 Lake Counting【DFS】

2016-08-12 17:36:04

#### poj 2386

2015-07-22 18:18:56

#### POJ 2386 Lake Counting

2015-08-23 10:25:35

#### POJ NO.2386 Lake Counting(算水洼)

2016-01-19 17:24:39

#### [POJ2386][OpenJudge] 2.5基本算法之搜索 Lake Counting

2016-08-26 16:46:19