zoukankan      html  css  js  c++  java
  • hdu 4252 A Famous City

    题目:

    Problem Description
    After Mr. B arrived in Warsaw, he was shocked by the skyscrapers and took several photos. But now when he looks at these photos, he finds in surprise that he isn't able to point out even the number of buildings in it. So he decides to work it out as follows:
    - divide the photo into n vertical pieces from left to right. The buildings in the photo can be treated as rectangles, the lower edge of which is the horizon. One building may span several consecutive pieces, but each piece can only contain one visible building, or no buildings at all.
    - measure the height of each building in that piece.
    - write a program to calculate the minimum number of buildings.
    Mr. B has finished the first two steps, the last comes to you.
     
    Input
    Each test case starts with a line containing an integer n (1 <= n <= 100,000). Following this is a line containing n integers - the height of building in each piece respectively. Note that zero height means there are no buildings in this piece at all. All the input numbers will be nonnegative and less than 1,000,000,000.
     
    Output
    For each test case, display a single line containing the case number and the minimum possible number of buildings in the photo.
     
    Sample Input 
    3
    1 2 3
    3
    1 2 1
    Sample Output
     
    Case 1: 3
    Case 2: 2
     

    题意:  把建筑看成矩形,问最少有多少个建筑

    参考:http://www.cnblogs.com/moonbay/archive/2012/07/24/2607234.html

    代码:

     1 #include<iostream>
     2 #include<stack>
     3 #include<stdio.h>
     4 using namespace std;
     5 
     6 stack < int >Q;
     7 
     8 int main( ){
     9         int n,a,x=0,sum;
    10         while(cin>>n){
    11             sum=0;
    12             while(!Q.empty())
    13                 Q.pop();
    14             for( int i=1;i<=n;i++){
    15                 scanf("%d",&a);
    16                 while(!Q.empty()&&Q.top()>=a){
    17                     if(Q.top()>a)   sum++;
    18                     Q.pop();
    19                 }
    20                 if(a>0) Q.push(a);
    21             }
    22             cout <<"Case " <<++x <<": " <<sum+Q.size() <<endl;
    23         }
    24         return 0;
    25 }
    View Code
  • 相关阅读:
    ubuntu上virtualbox无法找到usb设备【解决】
    try or install Ubuntu on MeegoPad T01
    213. 打家劫舍 II
    198. 打家劫舍
    70. 爬楼梯
    62. 不同路径
    idea | gitee 码云
    数据库 | 远程连接centos7上数据库
    JSP && Servlet | 上传图片到数据库
    bootstrap | 模态框
  • 原文地址:https://www.cnblogs.com/lysr--tlp/p/www.html
Copyright © 2011-2022 走看看