Uva 11059

 1 #include  <cstdio>
 2 int a[20];
 3 int main()
 4 {
 5     int n,p=1;long long ans,sum;
 6     while(~scanf("%d",&n))
 7     {
 8         for(int i=0;i<n;i++)
 9             scanf("%d",&a[i]);
10         ans=0;
11 
12         for(int i=0;i<n;i++)
13         {
14             sum=1;
15             for(int j=i;j<n;j++)
16             {
17                 sum*=a[j];
18                 if(sum>ans) ans=sum;
19             }
20         }
21 
22         printf("Case #%d: The maximum product is %lld.\n\n",p++,ans);
23     }
24     return 0;
25 }