poj2386——Lake Counting（搜索）

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

相邻的W组成一个池塘，统计池塘的个数，很水的搜索

#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <cstdio>
#include <set>
#include <vector>
#include <iomanip>
#include <stack>
#include <map>
#define MAXN 105
#define mod 9973
#define inf 0x3f3f3f3f
using namespace std;
int vis[MAXN][MAXN],n,m;
char a[MAXN][MAXN];
void fun(int x,int y)
{
    if(x<0||x>n||y<0||y>m||a[x][y]=='.'||vis[x][y])
        return;
    vis[x][y]=1;
    fun(x+1,y);
    fun(x-1,y);
    fun(x,y+1);
    fun(x,y-1);
    fun(x+1,y-1);
    fun(x+1,y+1);
    fun(x-1,y+1);
    fun(x-1,y-1);
}
int main()
{
    ios::sync_with_stdio(false);
    while(cin>>n>>m)
    {
        memset(a,'.',sizeof(a));
        for(int i=0; i<n; ++i)
            for(int j=0; j<m; ++j)
                cin>>a[i][j];
        memset(vis,0,sizeof(vis));
        int ans=0;
        for(int i=0; i<n; ++i)
            for(int j=0; j<m; ++j)
            {
                if(!vis[i][j]&&a[i][j]=='W')
                {
                    fun(i,j);
                    ans++;
                }
            }
        cout<<ans<<endl;
    }
    return 0;
}