HDU1241 Oil Deposits dfs C语言

题目：http://acm.hdu.edu.cn/showproblem.php?pid=1241

题目大意：简单的dfs~ 搜索地图，每找到一个油田，就搜索八个方向，将连着的油田标记为同一个。

算法：dfs

 

AC code：

View Code

 1 #include <stdio.h>
 2 #include <string.h>
 3 #include <stdlib.h>
 4 #define MAXN (100 + 10)
 5 char map[MAXN][MAXN];
 6 int oil;
 7 int m, n;
 8 
 9 int dx[8] = {-1,-1,-1, 0, 0, 1, 1, 1},
10  dy[8] = {-1, 0, 1,-1, 1,-1, 0, 1};
11 void Clear () {
12  memset(map, 0, sizeof(map));
13  oil = 0;
14 }
15 int inarea (int x, int y) {
16  return x >= 0 && x < m && y >= 0 && y < n;                        //判断越界
17 }
18 void dfs(int x, int y) {
19  int tx, ty;
20  int k;
21  for (k = 0; k < 8; k++) {
22   tx = x + dx[k];
23   ty = y + dy[k];
24   if (inarea(tx, ty) && map[tx][ty] == '@') {
25    map[tx][ty] = '*';                                        //将连着的油田标记为同一个
26    dfs(tx, ty);
27   }
28  }
29 }
30 int main () { 
31  int i, j;
32  while (~scanf ("%d%d", &m, &n), m || n) {
33   Clear();
34   for (i = 0; i < m; i++)
35    scanf ("%s", map[i]);
36   for (i = 0; i < m; i++)
37    for (j = 0; j < n; j++)
38     if (map[i][j] == '@') {
39      oil += 1;                                       //每找到一个油田，数目加1
40      dfs(i, j);
41     }
42   printf ("%d\n", oil);
43  }
44  return 0;
45 }

转载于:https://www.cnblogs.com/cloehui/archive/2011/07/20/2111559.html