Lake Counting(POJ-2386)

 1 #include <cstdio>
 2 
 3 const int MAX_N = 100, MAX_M = 100;
 4 char field[MAX_N][MAX_M+1];
 5 int n, m;
 6 
 7 void DFS(int x, int y);
 8 
 9 int main()
10 {
11     int num = 0;
12 
13     scanf("%d %d", &n, &m);
14     for (int i = 0; i < n; i++)
15         scanf("%s", field[i]);
16 
17     for (int i = 0; i < n; i++)
18         for (int j = 0; j < m; j++)
19             if (field[i][j] == 'W') {//从有W的地方DFS
20                 DFS(i, j);
21                 num++;
22             }
23     printf("%d\n", num);
24     return 0;
25 }
26 
27 void DFS(int x, int y)
28 {
29     //遍历8个方向
30     for (int dx = -1; dx <= 1; dx++)
31         for (int dy = -1; dy <= 1; dy++) {
32             int nx = x + dx;
33             int ny = y + dy;
34             //判断(nx, ny)是否在园子内且是否有积水
35             if (nx >= 0 && nx < n && ny >=0 && ny < m && field[nx][ny] == 'W') {
36                 field[nx][ny] = '.';
37                 DFS(nx, ny);
38             }
39         }
40 }