zoukankan      html  css  js  c++  java
  • 深搜模板

    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

    题目大意:找最大水蛙,及@8个方向相邻的组成水蛙,求个数

    #include <stdio.h>
    #include <iostream>
    #include <algorithm>
    #include <string.h>
    using namespace std;
    char mp[101][101];
    int n,m,sum=0;
    void DFS(int x,int y)
    {
        if(x>=0&&x<n&&y>=0&&y<m&&mp[x][y]=='@')
        {
            mp[x][y]='*';
            DFS(x-1,y);
            DFS(x-1,y-1);
            DFS(x-1,y+1);
            DFS(x,y-1);
            DFS(x,y+1);
            DFS(x+1,y);
            DFS(x+1,y-1);
            DFS(x+1,y+1);
        }
    }
    int main()
    {
        int i,j;
        while(1)
        {
            sum=0;
            scanf("%d%d",&n,&m);
            if(n==0&&m==0)
                break;
            memset(mp,'0',sizeof(mp));
            getchar();
            for(i=0;i<n;i++)
               for(j=0;j<m;j++)
                  scanf(" %c",&mp[i][j]);
            for(i=0;i<n;i++)
                for(j=0;j<m;j++)
               {
                   if(mp[i][j]=='@')
                   {
                        DFS(i,j);
                        sum++;
                   }
               }
            printf("%d
    ",sum);
        }
        return 0;
    }
  • 相关阅读:
    [补]2019HDU杭电多校第一场A
    [补]2019nowcoder牛客第三场F(暂且)
    [补]2019nowcoder牛客第一场E、I
    [学]从零(多项式基础与FFT)开始BM学习笔记
    [补]2019nowcoder牛客第二场E、H(upd0730)
    从一个简单的例子对win 服务程序进行讲解
    HTTP协议学习记录及总结
    Windows身份验证与forms身份验证的结合
    关于Sql server 的 几道面试题
    PlaceHolder控件的使用
  • 原文地址:https://www.cnblogs.com/zcy19990813/p/9702823.html
Copyright © 2011-2022 走看看