hdu4252

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<cmath>
 5 #include<algorithm>
 6 using namespace std;
 7 const int maxn=100010;
 8 int a[maxn];
 9 int main()
10 {
11     int n;
12     int cas=0;
13     while(scanf("%d",&n)!=EOF)
14     {
15         int ans=n,k=0;
16         for(int i=0;i<n;i++)
17         {
18             scanf("%d",&a[i]);
19             if(a[i]==0) {ans--;k=i;}
20             for(int j=i-1;j>=k;j--)
21             {
22                 if(a[i]>a[j]) break;
23                 if(a[i]==a[j]) {ans--;break;}
24             }
25         }
26         printf("Case %d: ",++cas);
27         printf("%d\n",ans);
28     }
29 }