nyoj-140-A Famous City//hdu-4252-A Famous City
2014-08-02 10:22
288 查看
A Famous City
时间限制:2000 ms | 内存限制:65535 KB难度:3
描述
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.
输入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.
输出For each test case, display a single line containing the case number and the minimum possible number of buildings in the photo.
样例输入
3 1 2 3 3 1 2 1
样例输出
Case 1: 3 Case 2: 2
#include<stdio.h> #include<string.h> int a[100010],b[100010]; int main() { int n,d=1,i,j,m; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) scanf("%d",&a[i]); memset(b,0,sizeof(b)); for(m=i=0;i<n;i++) { if(a[i]&&!b[i]) { m++; b[i]=1; for(j=i+1;j<n&&!b[j];j++) if(a[i]>a[j]) break; else if(a[i]==a[j]) b[j]=1; } } printf("Case %d: %d\n",d++,m); } return 0; }
相关文章推荐
- hdu 4252 A Famous City
- HDU 4252 A Famous City
- HDU 4252 A Famous City
- HDU:4252 A Famous City(单调栈)
- [HDU 4252] A Famous City[单调队列]
- HDU - 4252 A Famous City (单调栈)
- HDOJ 4252 A Famous City 单调栈
- nyoj107&&hdu A Famous ICPC Team
- HDU/HDOJ----4252 A Famous City
- hdu 4245 nyoj 25 A Famous Music Composer
- hdu A Famous City
- HDOJ 4252 A Famous City 单调栈
- HDU:4255 A Famous Grid(构造+BFS)
- NYOJ 17 单调递增最长子序列(O(n2))+HDU 1025 Constructing Roads In JGShining +NYOJ 214 单调递增子序列(二)(O(nlogn))(整理)
- hdu A Famous Stone Collector
- HDU 3080 The plan of city rebuild(prim和kruskal)
- HDU&&NYoj N!
- HDU 4255 A Famous Grid
- hdu 4496 D-City(并查集)
- HDU 4255 A Famous Grid