POJ-2386

Lake Counting

思路：DFS+递归
题目：
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.

代码：

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#pragma warning(disable:4996)
#define pf printf
#define sf scanf
char map[102][102];

using namespace std;
int n,m;
int dire[8][2] = { {0,-1},{1,-1},{1,0},{1,1},{0,1} ,{-1,-1},{-1,0},{-1,1} };
void DFS(int x, int y) {
        if (x<1 || y<1 || x>n || y>m||map[x][y]=='.')  return;//超出田地或超出池塘
    map[x][y] = '.';
    for (int i = 0; i < 8; i++) //map[x][y] == 'W',继续搜索8个方向/*本来是只搜索5各方向的，但是提交一直WA，还没想清楚为啥*/
        DFS(x + dire[i][0], y + dire[i][1]);
    return;
}

int main(void) {
int ans = 0;
cin >> n>>m;
getchar();
memset(map, '.', sizeof(map));
for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++)
        sf("%c", &map[i][j]);
    getchar();
}
for(int i=1; i<= n; i++)
     for (int j = 1; j <= m; j++) {//遍历，找到'X'开始往下搜
        if (map[i][j] == 'W') {
            DFS(i, j);
            ans++;
        }
    }

cout << ans << endl;
return 0;
}