POJ-2386 Lake Counting

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.

做题学英文

1. squares ：
n.平方( square的名词复数 ); 正方形; 广场; 方格;

2. ponds
n.池塘( pond的名词复数 );

3. adjacent ：
adj.邻近的，毗邻的; （时间上）紧接着的; 相邻;

4. diagram
n.图表; 图解; 示意图; [数]线图;
vt.用图表示; 图解;

思路：从左上角开始搜索W，找到W后进行dfs。一次dfs后与这个W相连的W则全部变成’.’,再寻找下一个W，再进行dfs，直到图中不再存在W为止。进行dfs的次数即为答案。

#include<iostream>
using namespace std;
int N,M;
char field[105][105];
void dfs(int x,int y){
    field[x][y]='.';
    for(int dx=-1;dx<=1;dx++){  //八个方向寻找连接的W 
        for(int dy=-1;dy<=1;dy++){
            int nx=x+dx;
            int ny=y+dy;
            if(nx >= 0 && nx < N && ny >= 0 && ny < M && field[nx][ny] == 'W')//若找到W在此基础上再找，直到找不到则返回 
                dfs(nx,ny);
        }
    }
    return ;
}
int main(){
    int res=0;
    scanf("%d%d",&N,&M);
    for(int i=0;i<N;i++)
    scanf("%s",field[i]);
    for(int i=0;i<N;i++){
        for(int j=0;j<M;j++){
            if(field[i][j]=='W'){
                dfs(i,j);
                res++;      //pond的个数 
            }       
        }
    }
    printf("%d\n",res);
    return 0;
} 

题目链接：

http://poj.org/problem?id=2386