A Famous City
Time Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 472Accepted Submission(s): 190
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
Sample Output
Case 1: 3
Case 2: 2
Hint
The possible configurations of the samples are illustrated below:
首先我想吐槽下这题目的给的测试数据,乍一看还以为求最大值(昨天比赛时就有人这么写)。 原本我以为是一栋房子可以在多张图片中出现,所以是先排序,在求不同层数的房子。接连wa两次! 得出一个结论,以后尽量看点点英语
题目原意是一栋房子可以接连出现在连续的几张照片中,给出的数字只代表这张照片中最高的楼。例如这两组数据:
5
1 2 1 2 1
10
1 2 3 4 5 4 3 2 1 0
的答案分别是3和5。第一组的三个1,可能是一栋一层的房子跨越了五张照片。而两个2一定代表两栋房子,因为中间的“1”。
题意知道后,这题就不难了!AC代码如下
#include<stdio.h>
#include<string.h>
int a[100005];
bool flag[100005];
int main()
{
int n,i,j,s=1;
while(scanf("%d",&n)!=EOF)
{
int ans=0;
for(i=0;i<n;i++)
scanf("%d",&a[i]);
memset(flag,0,sizeof(flag));
for(i=0;i<n;i++)
{
if(a[i]==0) {flag[i]=1;continue;}
int t=a[i];
if(!flag[i])
for(j=i+1;;j++)
{
if(a[j]==t) flag[j]=1;
else if(a[j]<t) break;
}
}
for(i=0;i<n;i++)
if(!flag[i]) ans++;
printf("Case %d: %d\n",s++,ans);
}
return 0;
}
分享到:
相关推荐
ACM HDU 2000->2099 解题报告 ACM HDU 2000->2099 解题报告 ACM HDU 2000->2099 解题报告
杭电OnlineJudge 200-2099的解题报告
HDU 1010-2500解题报告,ACMer可以借鉴一下
The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15 is 105. Input Input...
hdu1001解题报告
我去年暑假花了5天,把杭电ACM网站上2000到2099这100道题全AC了,又花了10来天精心写解题报告。 里面包括题目、解题思路、编程技巧以及参考源码。所有代码都是使用C/C++写的。 最近整理资料时无意间发现,打包...
杭电ACM2000到2099一百道题的解题报告,全部是AC后的源码,不容错过
Hdu 3333解题报告 题意描述: 给你n个数现在要你求在k个区间上[ai, bi]的不相同的数之和各是多少. N,000; k,000; 显然,这题不能用暴力来做。 这题我们选择用线段数来做。
hdu1290 解题报告 献给杭电五十周年校庆的礼物 (切西瓜问题,即平面分割空间)
100道 acm C语言 hdu 解题报告
HDU2501 Tiling_easy version 解题报告
HDU4802 GPA解题报告及一般代码的相关优化
解题报告|ACM|程序设计参考程序以及题目的分析
ACM题库,一些题目和答案,以及解题报告,传上来共享
ACM程序设计题目分析以及AC的源码
90%的杭电母函数解题报告,有题目加解题思路,和ac掉的代码
HDU2013暑期多校联合训练第一场0723-解题报告和标程
HDU解题报告,新手看看,高人也可以回顾下经典算法
搜索 dfs 解题代码 hdu1241
算菜价 Problem Description 妈妈每天都要出去买菜,但是回来后,兜里的钱也懒得数一数,到底花了多少钱真是一笔糊涂帐。现在好了,作为好儿子(女儿)的你可以给她用程序算一下了,呵呵。 Input ...