Description
![Download as PDF Download as PDF](https://i-blog.csdnimg.cn/blog_migrate/2ea975a8d421ce3226c46b0946fd5932.png)
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.
Input
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; otherwiseOutput
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.Sample Input
1 1 * 3 5 *@*@* **@** *@*@* 1 8 @@****@* 5 5 ****@ *@@*@ *@**@ @@@*@ @@**@ 0 0
Sample Output
0 1 2 2
简单的图
判断有几个不相连的油田
读下来
从第一个点开始
如果这个点是@并且没走过
cnt++
然后dfs周围的八个点
要把图像移动下
不然的数组会越界RE
#include <stdio.h>
#include <string.h>
char sen[120];
int flag[120][120], map[120][120];
void dfs(int x, int y){
if (flag[x][y] || !map[x][y])
return ;
flag[x][y] = 1;
dfs(x - 1, y);
dfs(x + 1, y);
dfs(x, y - 1);
dfs(x, y + 1);
dfs(x - 1, y - 1);
dfs(x - 1, y + 1);
dfs(x + 1, y - 1);
dfs(x + 1, y + 1);
}
int main(){
int n, m;
while (scanf("%d %d", &n, &m) && n && m) {
getchar();
int cnt = 0;
memset(map, 0, sizeof(map));
memset(flag, 0, sizeof(flag));
for (int i = 0; i < n; i++) {
gets(sen);
for (int j = 0; j < strlen(sen); j++)
if (sen[j] == '@')
map[i + 1][j + 1] = 1;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
if (map[i][j] && !flag[i][j]) {
cnt++;
dfs(i, j);
}
}
printf("%d\n", cnt);
}
return 0;
}