[UVA] 11059 Maximum Product

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std ;

int s[50];

int main(){
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n;
int m=0;
int num=0;
while(scanf("%d",&n)!=EOF){

memset(s,0,sizeof(s));
long long max = 0;
for(int i = 1 ; i<= n ; i++){
scanf("%d",&s[i]);
}
long long ans = 1 ;
for(int i = 1 ; i <= n ; i++){
for(int j = i ;j <=n ;j++){
ans=1;
for(int t = i ; t <= j ;t++){
ans *= s[t];
}
if(ans>max){
max = ans ;
}
}
}
printf("Case #%d: The maximum product is %lld.\n\n",++num,max);
}
return 0 ;
}