C - Oil Deposits寒假练习1-c

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
来源：poj1562
题目解析：
典型的搜索题目，问图中一共有几个相互独立的@块儿，即前后左右都不相邻的区块儿个数，直接深搜即可，每次搜过标记一下，每次遇到没有标记过得@，个数加一，并标记其相邻的@块儿，输出个数即可。
代码：

#include<stdio.h>
#include<string.h>
int m,n,v;
char map[105][105];
int next[8][2]={0,1,1,0,0,-1,-1,0,1,1,1,-1,-1,1,-1,-1};
void dfs(int x,int y)
{
    if(x>m||y>n||x<0||y<0||map[x][y]!='@')
    return;
    for(int i=0;i<8;i++)
    {
        int tx=x+next[i][0];
        int ty=y+next[i][1];
        dfs(tx,ty);
        map[x][y]='*';
    }
}
int main()
{
    int i,j;
    while(scanf("%d%d",&m,&n),m||n)
    {
        for(i=0;i<m;i++)
        {
            scanf("%s",map[i]);
        }
        v=0;
        for(i=0;i<m;i++)
        {
            for(j=0;j<n;j++)
            {
                if(map[i][j]=='@')
                {
                    v++;
                    dfs(i,j);
                }

            }
        }
        printf("%d\n",v);
    }
    return 0;
 }