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
深搜问题,输入字符之后遍历,每次找到@都搜索和@相连的位置(并计数)如果是@继续搜索并且把@变成;
#include <iostream>
#include<stdio.h>
#include<string.h>
#include<cmath>
#include<algorithm>
#include<map>
using namespace std;
int n,m,cont;
char a[105][105];
int b[8][2]={{1,0},{-1,0},{0,1},{0,-1},{1,1},{-1,1},{1,-1},{-1,-1}};//上下左右对角情况
void dfs(int x,int y)
{
int xx;//xx和yy为下一步走到的位置
int yy;
for(int i=0;i<8;i++)//八种情况八个方向
{
xx=x+b[i][0];
yy=y+b[i][1];
if(a[xx][yy]=='@'&&xx>=0&&yy>=0&&xx<m&&yy<n)//判断为@以及xx和yy没有超过数组边界
{
a[xx][yy]='*';
dfs(xx,yy);
}
}
}
int main()
{
while(scanf("%d %d",&m,&n)!=EOF)
{
if(m==0&&n==0)
break;
cont=0;
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
{
cin>>a[i][j];//这里有一些空格的陷阱,所以选择cin
}
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
{
if(a[i][j]=='@')
{
a[i][j]='*';
cont++;
dfs(i,j);
}
}
printf("%d\n",cont);
}
}