poj 2386 Lake Counting

Lake Counting

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 18440		Accepted: 9302

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

这是一道大水题，只要你懂得基本的dfs就能A掉，今天数据结构作业哦，下面贴代码：

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

const int maxn=105;
char mape[maxn][maxn];
int m,n,vis[maxn][maxn],cnt;

void dfs(int x,int y)
{
    vis[x][y]=1;
    for(int i=-1;i<=1;i++)
        for(int j=-1;j<=1;j++)
        if((!vis[x+i][y+j])&&(mape[x+i][y+j]=='W')&&(x+i>=1)&&(x+i<=m)&&(y+j>=1)&&(y+j<=n))
    {
        dfs(x+i,y+j);
        //vis[x+i][y+j]=1;
    }
}

int main()
{
    cin>>m>>n;
    for(int i=1;i<=m;i++)
        for(int j=1;j<=n;)
    {
        char c;
        scanf("%c",&c);
        if(c=='W'||c=='.')
            mape[i][j++]=c;
    }
    for(int i=1;i<=m;i++)
        for(int j=1;j<=n;j++)
            if((!vis[i][j])&&mape[i][j]=='W')
                {
                    dfs(i,j);cnt++;
                }
    cout<<cnt<<endl;
    return 0;
}