POJ 2386

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

 给你一个N*M的字符网格,要你求该网格中有多少个有字符’w’构造的8连通分量.

代码：

#include<cstdio>
using namespace std;
const int maxn=100+5;
char grid[maxn][maxn];
int R,C;
int ans;
void dfs(int r,int c)
{
    if(r<0||r>=R||c<0||c>=C||grid[r][c]!='W')
        return ;
    grid[r][c]='.';
    dfs(r,c+1);
    dfs(r,c-1);
    dfs(r+1,c);
    dfs(r-1,c);
    dfs(r+1,c+1);
    dfs(r-1,c-1);
    dfs(r+1,c-1);
    dfs(r-1,c+1);
}
int main()
{
    while(scanf("%d%d",&R,&C)==2)
    {
        for(int i=0;i<R;i++)
            scanf("%s",grid[i]);
        ans=0;
        for(int i=0;i<R;i++)
        for(int j=0;j<C;j++)if(grid[i][j]=='W')
        {
            ans++;
            dfs(i,j);
        }
        printf("%d\n",ans);
    }
    return 0;
}