OpenJ_Bailian - 3859

OpenJ_Bailian - 3859
Lake Counting
Time Limit: 1000MS      Memory Limit: 65536KB       64bit IO Format: %I64d & %I64u
Submit

Status
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
Submit

Status

来源： http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=352590

#include <cstdio>
#include <cstring>
char A[150][150];
bool visit[150][150];
int ans,N,M;
void DFS(int i,int j)
{
    if(!A[i][j]||visit[i][j]) return; //!边界或者已经访问
    if(A[i][j]=='.') return;
    visit[i][j]=true;
    DFS(i-1,j-1);DFS(i-1,j);DFS(i-1,j+1);
    DFS(i  ,j-1);           DFS(i  ,j+1);
    DFS(i+1,j-1);DFS(i+1,j);DFS(i+1,j+1);

}
int main()
{
    while(~scanf("%d %d",&N,&M))
    {
        memset(A,0,sizeof(A));ans=0;
        memset(visit,false,sizeof(visit));
        for(int i=1;i<=N;i++) scanf("%s",A[i]+1);
        for(int i=1;i<=N;i++)
            for(int j=1;j<=M;j++) if(A[i][j]=='W'&&!visit[i][j]) {ans++;DFS(i,j);}
        printf("%d\n",ans);
    }
    return 0;
}