HDU - 1241 Oil Deposits 搜索dfs

B - Oil Deposits

  HDU - 1241 

   遍历所有点，求出连通块的数量

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
//#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <string>
using namespace std;
#define ll long long
const int maxn = 10050;
char map[105][105];
int n, m, vis[105][105];
int dis[8][2] = {{0,1},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1},{1,0},{-1,0}};
void dfs(int i, int j) {
        vis[i][j] = 1;
        for (int k = 0; k < 8; k ++) {
                int xi = i + dis[k][0];
                int yi = j + dis[k][1];
                if (xi >= 0 && yi >= 0 && xi < n && yi < m && !vis[xi][yi] && map[xi][yi] == '@') {
                        dfs(xi, yi);
                }
        }
        return ;
}
int main()
{
        while (scanf("%d%d", &n, &m), n + m) {
                for (int i = 0; i < n; i ++) {
                        scanf("%s", map[i]);
                }
                int ans = 0;
                memset(vis, 0, sizeof(vis));
                for (int i = 0; i < n; i ++) {
                        for (int j = 0; j < m; j ++) {
                                if (!vis[i][j] && map[i][j] == '@') {
                                        ans ++;
                                        dfs(i, j);
                                }
                        }
                }
                printf("%d\n", ans);
        }
}