DFS(连通块) HDU 1241 Oil Deposits

题目传送门

 /*
     DFS：油田问题，一道经典的DFS求连通块。当初的难题，现在看上去不过如此啊
 */
 /************************************************
 Author        :Running_Time
 Created Time  :2015-8-4 10:11:11
 File Name     :HDOJ_1241.cpp
 ************************************************/

 #include <cstdio>
 #include <algorithm>
 #include <iostream>
 #include <sstream>
 #include <cstring>
 #include <cmath>
 #include <string>
 #include <vector>
 #include <queue>
 #include <deque>
 #include <stack>
 #include <list>
 #include <map>
 #include <set>
 #include <bitset>
 #include <cstdlib>
 #include <ctime>
 using namespace std;

 #define lson l, mid, rt << 1
 #define rson mid + 1, r, rt << 1 | 1
 typedef long long ll;
 const int MAXN = 1e2 + ;
 const int INF = 0x3f3f3f3f;
 const int MOD = 1e9 + ;
 char maze[MAXN][MAXN];
 bool vis[MAXN][MAXN];
 int dx[] = {-, , , , -, -, , };
 int dy[] = {, , -, , -, , -, };
 int n, m;

 bool judge(int x, int y)    {
     if (x <  || x > n || y <  || y > m || vis[x][y] || maze[x][y] != '@') return false;
     return true;
 }

 void DFS(int x, int y)  {
     for (int i=; i<; ++i) {
         int tx = x + dx[i], ty = y + dy[i];
         if (!judge (tx, ty))    continue;
         vis[tx][ty] = true; DFS (tx, ty);
     }
 }

 int main(void)    {     //HDU 1241 Oil Deposits
     while (scanf ("%d%d", &n, &m) == ) {
         if (m == ) break;
         for (int i=; i<=n; ++i)    {
             scanf ("%s", maze[i] + );
         }
         memset (vis, false, sizeof (vis));
         int ans = ;
         for (int i=; i<=n; ++i)    {
             for (int j=; j<=m; ++j)    {
                 if (maze[i][j] == '@' && !vis[i][j]) {
                     ans++;  vis[i][j] = true;   DFS (i, j);
                 }
             }
         }
         printf ("%d\n", ans);
     }

     return ;
 }