Oil Deposits HDU - 1241 搜索

题解

DFS进行搜索，求不同联通块数量，每次搜索标记搜索到的位置，标记的位置不再搜索。每次开始搜索答案+1
上下左右、左上、左下、右上、右下也算是联通。

AC代码

#include <stdio.h>
#include <bits/stdc++.h>
#define fst first
#define sed second
using namespace std;
typedef long long ll;

const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int N = 110;
int dir[8][2] = { -1, 0, 1, 0, 0, -1, 0, 1, -1, -1, -1, 1, 1, -1, 1, 1 };
char g[N][N];
bool vis[N][N];
int n, m;

void DFS(int x, int y)
{
    vis[x][y] = 1;
    for (int i = 0; i < 8; ++i)
    {
        int xx = x + dir[i][0], yy = y + dir[i][1];
        if (xx >= 1 && xx <= n && yy >= 1 && yy <= m && g[xx][yy] == '@' && !vis[xx][yy])
            DFS(xx, yy);
    }
}
int main()
{
#ifdef LOCAL
	freopen("C:/input.txt", "r", stdin);
#endif
    while (scanf("%d%d", &n, &m), m)
    {
        for (int i = 1; i <= n; ++i)
            scanf("%s", g[i] + 1);
        int ans = 0;
        memset(vis, 0, sizeof(vis));
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= m; ++j)
                if (g[i][j] == '@' && !vis[i][j])
                    DFS(i, j), ans++;
        printf("%d\n", ans);
    }

	return 0;
}