Lake Counting (深搜)

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

思路

这道题是求水洼的个数。一个水洼的周围如果存在其他水洼的话，会合并成一个大的水洼。这道题可以用深搜或者广搜都能做出来，我这里用的是深搜的方法。

#include <iostream>

using namespace std;
int m,n;
int res=0;
char a[102][102];

void dfs(int x,int y)
{
    a[x][y]='.';
    for(int dx=-1;dx<=1;dx++)
    {
        for(int dy=-1;dy<=1;dy++)
        {
            int nx=x+dx;
            int ny=y+dy;
            if(nx>=0&&nx<m&&ny>=0&&ny<n&&a[nx][ny]=='W')
                dfs(nx,ny);
        }
    }

}

void solve()
{
    for(int i=0;i<m;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(a[i][j]=='W')
            {
                dfs(i,j);
                res++;
            }
        }
    }
}

int main()
{
    while(cin>>m>>n)
    {
        if(m==0&&n==0)
            break;
        for(int i=0;i<m;i++)
        {
            cin>>a[i];
        }
        /*for(int i=0;i<m;i++)
        {
            for(int j=0;j<n;j++)
            {
                cout<<a[i][j]<<" ";
            }
            cout<<endl;
        }*/
        solve();
        cout<<res<<endl;
    }
    return 0;
}