洛谷 P1596 [USACO10OCT] Lake Counting S

题目描述

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.

由于近期的降雨，雨水汇集在农民约翰的田地不同的地方。我们用一个NxM(1<=N<=100;1<=M<=100)网格图表示。每个网格中有水('W') 或是旱地('.')。一个网格与其周围的八个网格相连，而一组相连的网格视为一个水坑。约翰想弄清楚他的田地已经形成了多少水坑。给出约翰田地的示意图，确定当中有多少水坑。

输入格式

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.

第1行：两个空格隔开的整数：N 和 M 第2行到第N+1行：每行M个字符，每个字符是'W'或'.'，它们表示网格图中的一排。字符之间没有空格。

输出格式

Line 1: The number of ponds in Farmer John's field.

一行：水坑的数量

输入输出样例

输入 

10 12
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.

输出 

3

说明/提示

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

这是一道经典的DFS题目，解题的思路也很简单，从（0，0）处开始搜索，如果是W的话则把这一位置与之相连的所有的W全部换为 " .  " 然后再返回主函数中继续搜索，这样每次在主函数中进行的搜索的次数就是最终的水坑的数量。

#include <bits/stdc++.h>
using namespace std;

//定义地面的行数列数
int n,m;
//构建二维数组land
char land[100][100] = {0};

//深搜函数，把周围的所有的“W”换成“.”
void dfs(int x,int y){
    land[x][y] = '.';
    
    //周围的3×3的方格挨个排查
    for(int dx = -1; dx <= 1; dx++){
        for(int dy = -1; dy <= 1; dy ++){
            int nx = x+dx, ny = y+dy;
            
            //这里不要忘记加上判断nx,ny在n,m范围内！！
            if(nx >= 0 && nx < n&& ny >= 0 && ny <m && land[nx][ny] == 'W'){

                //递归深搜
                dfs(nx,ny);
            }
        }
    }
}

int main()
{
    int count = 0;
    cin>>n>>m;
    for(int i = 0 ; i < n ;i ++){
        for(int j = 0 ; j < m ; j ++){
            cin>>land[i][j];
        }
    }

    //主函数的搜索部分
    for(int i = 0 ; i < n ; i ++){
        for(int j = 0 ; j < m ; j ++){
            if(land[i][j] == 'W'){
                count++;
                dfs(i,j);
            }
        }
    }
    cout<<count;
    return 0;
}