POJ 2386 Lake Counting

题目链接：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.

Source

USACO 2004 November

和Oil Deposites其实是一样的，只是换了题目的另一种表述而已。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

char mp[110][110];
int n, m;
void dfs(int x, int y)
{
    mp[x][y] = '.';
    for(int dx = -1; dx <= 1; dx++)
        for(int dy = -1; dy <= 1; dy++)
        {
            int tx = x+dx, ty = y+dy;
            if(tx >= 0 && tx < n && ty >= 0 && ty < m && mp[tx][ty] == 'W')
                dfs(tx, ty);
        }
}
int main()
{
    char c;
    while(~scanf("%d%d%c", &n, &m, &c))
    {
        for(int i = 0; i < n; i++)
            scanf("%s", mp[i]);
        int cnt = 0;
        for(int i = 0; i < n; i++)
            for(int j = 0; j < m; j++)
                if(mp[i][j] == 'W')
                {
                    cnt++;
                    dfs(i, j);
                }
        printf("%d\n", cnt);
    }
    return 0;
}