UVA 11059 Maximum Product

#include<bits/stdc++.h>
using namespace std;
long long n,t,i,j,s,ans,a[30];
int main(){
	while(scanf("%lld",&n)==1){
		t++;
		for(i=1;i<=n;i++)
			scanf("%lld",&a[i]);
		ans=0;
		for(i=1;i<=n;i++){
			s=1;
			for(j=i;j<=n;j++){
				s*=a[j];
				ans=max(ans,s);
			}
		}
		printf("Case #%lld: The maximum product is %lld.\n\n",t,ans);
	}
	return 0;
}