zoukankan      html  css  js  c++  java
  • jQuery火箭图标返回顶部代码

    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 "stdafx.h"
     2 #include<iostream>
     3 #include<string>
     4 using namespace std;
     5 
     6 int m, n;
     7 char G[101][101];
     8 int dir[8][2] = { { -1,-1 },{ -1,0 },{ -1,1 },{ 0,1 },{ 0,-1 },{ 1,1 },{ 1,0 },{ 1,-1 } };
     9 void DFS(int x, int y)
    10 {
    11     G[x][y] = '*';
    12     for (int i = 0; i < 8; i++)
    13     {
    14         int zx = x + dir[i][0];
    15         int zy = y + dir[i][1];
    16         if (G[zx][zy] == '@'&&zx >= 0 && zx < m && zy>=0 && zy < n)
    17             DFS(zx, zy);
    18     }
    19 }
    20 
    21 int main()
    22 {
    23     while (cin >> m >> n)
    24     {
    25         if (m == 0 && n == 0)break;
    26 
    27         for (int i = 0; i < m; i++)
    28             for (int j = 0; j < n; j++)
    29                 cin >> G[i][j];
    30         int sum = 0;
    31         for (int i = 0; i<m; i++)
    32             for (int j = 0; j < n; j++)
    33             {
    34                 if (G[i][j] == '@')
    35                 {
    36                     DFS(i, j);
    37                     sum++;
    38                 }
    39             }
    40         cout << sum << endl;
    41     }
    42     return 0;
    43 }

     测试结果:

  • 相关阅读:
    Linux报错排解
    linux中wget 、apt-get、yum rpm区别
    Java NIO系列教程
    Java NIO系列教程(七) FileChannel
    使用一条sql查询多个表中的记录数
    ERROR 1045 (28000): Access denied for user 'root'@'localhost' (using password: YES)
    java.security.NoSuchAlgorithmException: SHA1PRNG SecureRandom not available
    javax.net.ssl.SSLHandshakeException: sun.security.validator.ValidatorException: PKIX path building failed
    Oracle查询锁表和解锁
    Data source rejected establishment of connection, message from server: "Too many connections"
  • 原文地址:https://www.cnblogs.com/Trojan00/p/8981376.html
Copyright © 2011-2022 走看看