POJ2386-Lake Counting

 1 #include <iostream>
 2 using namespace std;
 3 
 4 
 5 int N, M;
 6 char field[100][100];
 7 
 8 
 9 //现在位置
10 void dfs(int x, int y)
11 {
12     //将现在位置替换为.
13     field[x][y] = ‘.‘;
14 
15     //循环遍历8个移动方向
16     for (int dx = -1; dx <= 1; dx++)
17     {
18         for (int dy = -1; dy <= 1; dy++)
19         {
20             //移动到(nx,ny)位置
21             int nx = x + dx, ny = y + dy;
22             //判断是否再园子内，并且是否有积水
23             if (0 <= nx && nx < N && 0 <= ny && ny < M && field[nx][ny] == ‘W‘)
24                 dfs(nx, ny);
25         }
26     }
27 
28     return;
29 }
30 
31 int main()
32 {
33     while (cin >> N >> M)
34     {
35         int res = 0;
36         for (int i = 0; i < N; i++)
37         {
38             for (int j = 0; j < M; j++)
39             {
40                 cin >> field[i][j];
41             }
42         }
43 
44         
45         for (int i = 0; i < N; i++)
46         {
47             for (int j = 0; j < M; j++)
48             {
49                 //从有W的地方开始dfs
50                 if (field[i][j] == ‘W‘)
51                 {
52                     dfs(i, j);
53                     res++;
54                 }
55             }
56         }
57         cout << res << endl;
58     }
59 
60     return 0;
61 }