【链接】hdu1241点击打开链接
【题目】
Oil Deposits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
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
0122
Source
【代码】
#include<string>
using namespace std;
int m,n;
char a[101][101];
int mark[101][101];
int xx[8]={1,-1,0, 0,1,-1,-1, 1};//用来搜索相邻的格子
int yy[8]={0, 0,1,-1,1,-1, 1,-1};
void DFS(int x,int y)//输入该元素的下标,搜索相邻的
{
int i;
int x1,y1;
for(i=0;i<8;i++)//8种相邻的情况
{
x1=x+xx[i];
y1=y+yy[i];
if(x1<m&&x1>=0&&y1<n&&y1>=0&&mark[x1][y1]==0&&a[x1][y1]=='@')
{
mark[x1][y1]=1;//把与之相邻的都标记为1
DFS(x1,y1);
}
}
}
int main()
{
int sum,i,j;
while(scanf("%d%d",&m,&n)!=EOF)
{
if(m==0&&n==0) break;
memset(mark,0,sizeof(mark));//首先初始为0
for(i=0;i<m;i++)
scanf("%s",a[i]);
sum=0;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
if(mark[i][j]==0&&a[i][j]=='@')//没统计过且为@
{
sum++;//加上一个
mark[i][j]=1;//去过标记为1
DFS(i,j);//进行搜索
}
}
}
printf("%d\n",sum);
}
return 0;
}