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.

输入

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

代码：

#include<bits/stdc++.h>
using namespace std;
int m,n,tot,dx[8]={0,0,1,1,1,-1,-1,-1},dy[8]={1,-1,0,1,-1,0,1,-1};
char a[110][110];
void dfs(int x,int y)
{
    a[x][y]='.';//标记为干燥，意为搜索过 
    for(int i=0;i<8;i++)
    for(int j=0;j<8;j++)
    {
        int xx=x+dx[i],yy=y+dy[i];
        if(xx>0&&xx<=m&&yy>0&&yy<=n&&a[xx][yy]=='W')
        dfs(xx,yy);
    } 
}
int main()
{
    cin>>m>>n;
    for(int i=1;i<=m;i++)
    for(int j=1;j<=n;j++)
    cin>>a[i][j];
    for(int i=1;i<=m;i++)
    for(int j=1;j<=n;j++)
    if(a[i][j]=='W')
    {
        dfs(i,j);
        tot++;
    } 
    cout<<tot<<endl;
    return 0;
}