hdu4252 大水题
来源:互联网 发布:淘宝天猫评价采集 编辑:程序博客网 时间:2024/04/26 11:16
A Famous City
A Famous City
Time Limit : 10000/3000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 46 Accepted 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.
- 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
31 2 331 2 1
Sample Output
Case 1: 3Case 2: 2HintThe 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;
}
没有必要再看
- hdu4252 大水题
- hdu4252
- 大水题!!!
- 大水题
- poj 1656 大水题
- POJ 2328 大水题
- hdu 4247 大水题
- hdu 4206 大水题
- 大水题Q2002
- 大水题Q2003
- 大水题Q2006
- 暴力枚举大水题
- nefu 648 大水题
- poj2707~大水题
- HDOJ1234|大水题
- hdu1018(大水题)
- sgu299:Triangle(大水题)
- poj1154(大水题)
- hdu 4247 大水题
- 直接跳转到app store指定应用页面或评论页面
- Linux下C++的多线程编程---(转载)
- spring mvc注解实现
- It 经典网站
- hdu4252 大水题
- C语言枚举类型
- jquery $.each 和for 怎么跳出循环(终止本次循环)
- Ubuntu解压缩zip,tar,tar.gz,tar.bz2
- 深入剖析jsp四种属性范围(简单实例)
- hdu 4255 BFS 小水
- glPushMatrix和glPopMatrix的作用
- 转自:MoreWindows 秒杀多线程
- ACE_Get_Opt解析命令行