枚舉所有起點和終點即可
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
//freopen("d:\\h.txt","w",stdout);
int n,NO=1;
while(cin>>n)
{
long long int a[20]={};
int k=n;
while(n--)
{
cin>>a[n];
}
long long int sum=1,max=0;
for(int i=0;i<k;i++)
{
for(int j=i;j<k;j++)
{
sum*=a[j];
if(sum>max)
max=sum;
}
sum=1;
}
cout<<"Case #"<<NO++<<": The maximum product is "<<max<<"."<<endl<<endl;
}
return 0;
}