POJ2386 Lake Counting

                                              2386:Lake Counting

总时间限制:  1000ms

内存限制:  65536kB

描述

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.

输入

* 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.

输出

* 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.

 

问题分析

选中一个W，然后将邻接的W全部变换成‘.’。每次dfs就是一个水洼。

#include <bits/stdc++.h>
using namespace std;
#define fr(i, r, n) for(int i = r; i < n; ++i)
const int maxn = (int)2e5 +10;
typedef long long ll;

int n, m;
char s[105][105];
void dfs(int x, int y)
{
    s[x][y] = '.';
    fr(i, -1, 2)//循环遍历8个方向
    {
        fr(j, -1, 2)
        {
            int nx = x + i;
            int ny = y + j;
            if(nx>=0&&nx<n&&ny>=0&&ny<m&&s[nx][ny] == 'W') dfs(nx, ny);
            //当没有越界并且是'W'的时候继续dfs
        }
    }
    return ;
}
int main()
{
    cin>>n>>m;
    int ans = 0;
    fr(i, 0, n)
    {
        fr(j, 0, m)
            cin>>s[i][j];
    }
    fr(i, 0, n)
    {
        fr(j, 0, m)
        {
            if(s[i][j] == 'W')
            {
                dfs(i, j);
                ans++;
            }
        }
    }
    cout<<ans<<endl;

    return 0;
}