A Famous City
A Famous City
Time Limit : 10000/3000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 46Accepted Submission(s) : 18
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:
#include<stdio.h>
int a[100000+100];
int main()
{
int n,cas=0,i,j,cnt,ans;
while(scanf("%d",&n)!=EOF)
{
ans=n;
if(n==0) {printf("Case %d: 0\n",++cas);continue;}
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
if(a[i]==-1) continue;
if(a[i]==0) {ans--;continue;}
for(j=i+1;j<n;j++)
{
if(a[j]==0||a[j]<a[i]) break;
if(a[j]==a[i]) {ans--; a[j]=-1;}
}
}
printf("Case %d: %d\n",++cas,ans);
}
return 0;
}
没有必要再看
分享到:
相关推荐
一个十分简单的程序,能够ac杭电hdu的第2050题,无注释,简单明了
这是HDU acm 其中一部分题的代码,后续代码会继续上传。
收集的部分HDOJ杭电ACM题的代码 大牛勿下 全是基础供初级acmer使用
离线OJ题库(HDU ZJU等,部分有答案),需联网。
ACM HDU题目分类,我自己总结的大概只有十来个吧
HDU 动态规划(46道题目
HDU的一题........HDU DP动态规
100道 acm C语言 hdu 解题报告
很适合ACM初学者的文档, 题目,代码,解体思路一应俱全
涵盖注册、入门的十题答案,适合刚刚接触hdu的同学。
蟠桃记 1 折线分割平面 2 不容易系列之一 2 骨牌铺方格 3 不容易系列之(3)—— LELE的RPG难题 3 Children’s Queue 3 献给杭电五十周年校庆的礼物 3 钥匙计数之二 3 钥匙计数之一 3 母牛的故事 3 ...
HDU的1250,主要是利用高精度加法,但是代码有点繁琐,效率不是很高
杭电ACMhdu1163
HDU 的ACM 题目,只做了一些简单的,都是用JAVA语言写的
HDU1059的代码
hdu1001解题报告
hdu 1574 passed sorce
我写的hdu上的一些题AC的题的代码 也许你会有用
hdu-acm源代码(上百题)hdu-acm源代码、hdu-acm源代码hdu-acm源代码