暴力求解——UVA 572(简单的dfs)

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 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

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问题，就是一个m*n的矩形里面有多少块封闭的@区间，用深搜的方法即可
程序代码：

#include <cstdio>
using namespace std;
int c[][]={{,},{,},{,},{-,},{-,},{-,-},{,-},{,-}};
char a[][];
int m,n,d;
void dfs(int i,int j)
{

        a[i][j]='*';
        for(int k=;k<;k++)
        {
            int x=i+c[k][];
            int y=j+c[k][];
           if(a[x][y]=='@'&&x>=&&x<=m&&y>=&&y<=n)
                dfs(x,y);
        }
        return ;
}

int main()
{
while(scanf("%d%d",&m,&n)==&&m&&n)
 {
     d=;
     int i,j;
    for( i=;i<m;i++)
        scanf("%s",a[i]);
    for( i=;i<m;i++)
        for( j=;j<n;j++)
            if(a[i][j]=='@')
        {         d++;
                dfs(i,j);
        }
    printf("%d\n",d);
    }
 return ;
}