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 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...
  • a305657
  • a305657
  • 2013年01月31日 22:19
  • 401

hdu4252

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

HDU 1347 Grandpa is Famous

Grandpa is Famous Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Other...

HDU:4251 The Famous ICPC Team Again(划分树)

题意:给一组数字,多次查询求中位数。 思路:划分树。 #include #include #include #include #include #include #include u...
  • kkkwjx
  • kkkwjx
  • 2015年04月18日 14:18
  • 330

【原创】【组合数学】HDU 4248 A Famous Stone Collector

A Famous Stone Collector题目DescriptionMr. B loves to play with colorful stones. There are n colors of...

hdu4255A Famous Grid(BFS,优先队列)

1.题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=4255   2.参考代码:   #include #include #include #in...

HDU4255-A Famous Grid

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4255 题意描述:在一个蛇形矩阵中,素数的格子不能走,问从一个合数到另一个合数最少需要几步,没有解时输出...
  • vjudge
  • vjudge
  • 2012年07月22日 16:12
  • 331

HDU4251 The Famous ICPC Team Again(划分树裸)

题意:长度为n的数列,有m次询问,每次输出区间[l,r]的中位数。 思路:划分树模板套上即可。 #include #include #include #include #inclu...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU4252:A Famous City
举报原因:
原因补充:

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