Problem Description
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; 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.
Output
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
这道题看了很多别人的代码,DFS和BFS都有人用;我首先想到的是BFS,这也没什么,不过令我纠结的是,它居然可以走8个方向,让我卡了很久……不过仔细分析sample input,从第二个例子可以分析得出来!!!
# include<stdio.h>
int m,n;
int dir[8][2]={{0,-1},{-1,-1},{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1}};
char str[110][110];
void bfs(int a,int b)
{
int i,c,d;
for(i=0;i<8;i++)
{
c=a+dir[i][0];
d=b+dir[i][1];
if(c>=0&&c<m&&d>=0&&d<n&&str[c][d]=='@')
{
str[c][d]='*';
bfs(c,d);
}
}
}
int main()
{
int i,j,num;
while(scanf("%d",&m))
{
if(m==0)
break;
scanf("%d",&n);
for(i=0;i<m;i++)
scanf("%s",str[i]);
num=0;
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
if(str[i][j]=='@')
{
num++;
str[i][j]='*';
bfs(i,j);
}
}
printf("%d\n",num);
}
return 0;
}