Lake Counting

题记：最近新生在培训搜索，自己心血来潮就做了几个。本题题意为找池塘，一个吃糖的八格如果有水（W）就算一个池塘

Lake Counting

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 21728		Accepted: 10941

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.
代码：
#include<stdio.h>
#include<string.h>
int vis[101][101];
char c[101][101];
int a,b;
int t[8][2]={{-1,0},{1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1}};
void BFS(int x,int y)
{
    for(int i=0;i<8;i++)
    {
        int X=x+t[i][0];int Y=y+t[i][1];
        if(X>=0&&X<a&&Y>=0&&Y<b&&vis[X][Y]==0&&c[X][Y]=='W')
        {
            vis[X][Y]=1;
             BFS(X,Y);
        }
    }
}
int main()
{
    int sum=0;
    int i,j;
    memset(vis,0,sizeof(vis));
    scanf("%d%d",&a,&b);
    getchar();
    for(i=0;i<a;i++)
    scanf("%s",c[i]);
    for(i=0;i<a;i++)
    {
        for(j=0;j<b;j++)
        {
            if(vis[i][j]==0&&c[i][j]=='W')
            {
                vis[i][j]=1;
                BFS(i,j);
                sum++;

            }
        }
    }
    printf("%d\n",sum);
}

Sample Output

3