zoukankan      html  css  js  c++  java
  • poj1562--Oil Deposits

    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

    0122

    分析:向八个方向搜索、

    源码:

    #include <stdio.h>
    #include<algorithm>
    #include<iostream>
    using namespace std;
    char map[101][101];
    int n, m, p;
    void dfs(int i, int j)//递归函数
    {
        if(map[i][j]!='@' || i<0 || j<0 || i>=m || j>=n) return;
        else
        {
            map[i][j]='*';//扫过的都变成'*'
            dfs(i-1, j-1);
            dfs(i-1, j);
            dfs(i-1, j+1);
            dfs(i, j-1);
            dfs(i, j+1);
            dfs(i+1, j-1);
            dfs(i+1, j);
            dfs(i+1, j+1);
        }
    }
    int main()
    {
        int i, j;
        while(scanf("%d%d",&m,&n)!=EOF)
        {
            if(m==0 || n==0) break;
            p = 0;
            for(i = 0; i < m; i++)
                for(j = 0; j < n; j++)
                //scanf("%c",&map[i][j]);
                    cin>>map[i][j];
            for(i = 0; i < m; i++)
            {
                for(j = 0; j < n; j++)
                {
                    if(map[i][j] == '@')
                    {
                        dfs(i, j);
                        p++;
                    }
                }
            }
            printf("%d
    ",p);
        }
    
        return 0;
    }
    


     

     

  • 相关阅读:
    13.4 对锁和字段风格的事件的微小改变
    JavaWeb-session相关常用的方法
    JavaWeb-UUID
    JavaWeb-seession原理
    JavaWeb-HttpSession入门
    JavaWeb-Cookie的路径
    JavaWeb-Cookie的生命
    JavaWeb-Cookie介绍
    JavaWeb-JSP原理
    JSP文件生成的java文件和class文件所在的路径(eclipse和tomcat)
  • 原文地址:https://www.cnblogs.com/dyllove98/p/3220245.html
Copyright © 2011-2022 走看看