HDU4252:A Famous City

原创 2013年12月01日 21:17:55
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
Hint
The possible configurations of the samples are illustrated below:
 


 

这道题算是比较难理解的了

题意:
一张相片上的很多建筑相互遮住了,根据高低不同就在相片上把一座高楼的可见部分作为一个矩形,
并用数字描述其高度,若一张相片上的两个建筑群中间有空地,高度则为0;求最少有多少个建筑;
思路:
1 2 1最少为2座,因为2把1挡住了,而3 1 3则为3座,1挡不住3;
如:1 2 3 1 2 3 0 1
输入的0不是建筑,则输入的总个数减去0的个数就是最多可能有的建筑数,设为s;
再从第一个开始从前往后搜,若发现比它高的则继续搜,若发现比它低的则说明它是一个独立的建筑,
这时可以返回搜其它的;若与它相等,说明这时它们还没有出现比它们低的建筑,则视其为同一个建筑,
则s减1;

 

 

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

int a[1000005],x,len;

int main()
{
    int n,i,cas = 1,ans,j;
    while(~scanf("%d",&n))
    {
        ans = 0;
        for(i = 0; i<n; i++)
            scanf("%d",&a[i]);
        if(a[0]==0)
            ans++;
        for(i = 1; i<n; i++)
        {
            if(a[i]==0)
                ans++;
            else
            {
                for(j = i-1; j>=0; j--)
                {
                    if(a[i]>a[j])
                        break;
                    else if(a[i]==a[j])
                    {
                        ans++;
                        break;
                    }
                }
            }
        }
        printf("Case %d: %d\n",cas++,n-ans);
    }

    return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU4252:A Famous City

Problem Description After Mr. B arrived in Warsaw, he was shocked by the skyscrapers and took sever...

hdu4252 大水题

A Famous City A Famous City Time Limit : 10000/3000ms (Java/Other)   Memory Limit : 32768/32768K...

hdu 4252 #想法

A Famous City Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

HDU4252--栈

Description After Mr. B arrived in Warsaw, he was shocked by the skyscrapers and took several pho...

hdu4252

/* 分析:     水~ - -     用了次快排,由高到低开始往两侧扫描,如果这个 当前的这个高度只出现了这一次,那么对于这个高度就 不用扫描了。             &...

HDU:4255 A Famous Grid(构造+BFS)

题意:给一个表,问两个位置之间的最短距离是多少,其中素数位置不能经过。 思路:坐标范围是10000,也就是说这个表大约是100*100,当然题目中表是无穷大的,由于有些位置不能走实际上可能会大于100...

BFS广搜——hdu 4255 A Famous Grid

点击打开链接                                     A Famous...

【DP】 hdu4249 A Famous Equation

A Famous Equation http://acm.hdu.edu.cn/showproblem.php?pid=4249 Problem Description Mr...

hdu 42445A Famous Music Composer

A Famous Music Composer Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java...

hdu 4251 The Famous ICPC Team Again(划分树裸题)

The Famous ICPC Team Again Time Limit: 30000/15000 MS (Java/Others)    Memory Limit: 32768/32768 K ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)