hdu4252 大水题

最新推荐文章于 2019-04-17 19:00:31 发布

chasexie(xiehonghao)

最新推荐文章于 2019-04-17 19:00:31 发布

阅读量654

点赞数

分类专栏：小水文章标签： each integer numbers input less ini

本文链接：https://blog.csdn.net/hnust_xiehonghao/article/details/7861492

版权

小水专栏收录该内容

51 篇文章 0 订阅

订阅专栏

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.

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;
}