A Famous City

Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1671 Accepted Submission(s): 644

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:

  
   
   

 <??http://www.2cto.com/kf/ware/vc/" target="_blank" class="keylink">vcHJlPgoKCiAKPGJyPgoKU291cmNlCgpGdWRhbiBMb2NhbCBQcm9ncmFtbWluZyBDb250ZXN0IDIwMTIKCiAKPGJyPgoKPGJyPgo8cD48L3A+CjxwPjxicj4KPC9wPgo8cD48cHJlIGNsYXNzPQ=="brush:java;">#include 
  
   
#include 
   
     #include 
    
      #include 
     
       #include 
      
        using namespace std; stack
       
         stk; int n; int main() { int cas=1; while(scanf("%d",&n)!=EOF) { int ans=0; while(!stk.empty()) stk.pop(); for(int i=0;i
        
         x) { stk.pop(); ans++; } else if(stk.top()==x) { flag=false; break; } else if(stk.top()


【大中小】【打印】【繁体】【投稿】【收藏】【推荐】【举报】【评论】【关闭】【返回顶部】
分享到:
上一篇：C++ Singleton + MultiThread	下一篇：hdu 5065 数学题

帐　　号:

密码: (新用户注册)

验证码:

表　　情:

内　　容: