1411272217-hd-Oil Deposits

Oil Deposits

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13068 Accepted Submission(s): 7571

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

題目大意 找@的數量，如果在其周圍的算一個集體，求一共有多少個@的集體。 解題思路 這道題用到了深搜的知識。找到一個@，總數+1，然後用遞歸的方法判斷其周圍的情況，如果其周圍有@，則將其變成*。 代碼

#include
char a[110][110];
int m,n;//將其存到外面，當做全局變量
void dfs(int x,int y)
{
	if(x<0||x>=n||y<0||y>=m)
	    return;
	if(a[x][y]=='@')
	{
		a[x][y]='*';
		dfs(x-1,y-1);
		dfs(x,y-1);
		dfs(x+1,y-1);
		dfs(x-1,y);
		dfs(x+1,y);
		dfs(x-1,y+1);
		dfs(x,y+1);
		dfs(x+1,y+1);//可以多個同時遞歸。 
	}//用遞歸來搜索。 
	return;
}
int main()
{
	int i,j,k;
	int sum;
	while(scanf("%d%d",&n,&m),n+m)
	{
		getchar();
		for(i=0;i