The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then
analyzes each plot separately, using sensing equipment to determine whether or not the plot contains oil. A plot containing oil is called a pocket. If two pockets are adjacent, then they are part of the same oil deposit. Oil deposits can be quite large and
may contain numerous pockets. Your job is to determine how many different oil deposits are contained in a grid.

The input file contains one or more grids. Each grid begins with a line containing m and n, the number of rows and columns in the grid, separated by a single space. If m = 0 it signals the end of the input; otherwise 1 <= m <= 100 and 1 <=
n <= 100. Following this are m lines of n characters each (not counting the end-of-line characters). Each character corresponds to one plot, and is either `*', representing the absence of oil, or `@', representing an oil pocket.

For each grid, output the number of distinct oil deposits. Two different pockets are part of the same oil deposit if they are adjacent horizontally, vertically, or diagonally. An oil deposit will not contain more than 100 pockets.

1 1

*

3 5

*@*@*

**@**

*@*@*

1 8

@@****@*

5 5

****@

*@@*@

*@**@

@@@*@

@@**@

0 0

0

1

2

2

DFS求连通块入门题，直接把地图跑一边，找到符合点计数一下，dfs遍历所有的连通块变成普通的。

#include<iostream>

#include<cmath>

using namespace std;

char map[105][105];

int m, n, t;

int dir[8][2] = { { -1, -1 }, { -1, 0 }, { -1, 1 }, { 0, -1 }, { 0, 1 }, { 1, -1 }, { 1, 0 }, {1,1} };

void dfs(int si, int sj)

{

    if (si <= 0 || sj <= 0 || si > m || sj > n)

        return;

    for (int i = 0; i < 8; i++)

    {

        if (map[si + dir[i][0]][sj + dir[i][1]] != '*')

        {

            map[si + dir[i][0]][sj + dir[i][1]] = '*';

            dfs(si + dir[i][0], sj + dir[i][1]);

        }

    }

    return;

}

int main()

{

    while (cin >> m >> n&&(m||n))

    {

        for (int i = 1; i <= m;i++)

        for (int j = 1; j <= n; j++)

            cin >> map[i][j];

        t = 0;

        for (int i = 1; i <= m; i++)

        for (int j = 1; j <= n; j++)

        {

            if (map[i][j] == '@')

            {

                map[i][j] = '*';

                t++;

                dfs(i, j);

            }

        }

        printf("%d\n", t);

    }

    return 0;

}