UVA 11059 Maximum Product（枚举start+end）

# include<cstdio>
# include<iostream>
# include<algorithm>
# include<functional>
# include<cstring>
# include<string>
# include<cstdlib>
# include<iomanip>
# include<numeric>
# include<cctype>
# include<cmath>
# include<ctime>
# include<queue>
# include<stack>
# include<list>
# include<set>
# include<map>

using namespace std;

const double PI=4.0*atan(1.0);

typedef long long LL;
typedef unsigned long long ULL;

# define inf 999999999
# define MAX 23

int a[MAX];

int n;

int main(void)
{
    int icase = 1;
    while ( cin>>n )
    {
        for ( int i = 1;i <= n;i++)
    {
        cin>>a[i];
    }
    LL ans = 0;
    for ( int i = 1;i <= n;i++ )
    {
        LL t = 1;
        //ans = max(ans,t);
        for ( int j = i;j <= n;j++ )
        {
            t*=a[j];
            ans = max(ans,t);
        }
    }
    printf("Case #%d: The maximum product is %lld.\n\n",icase++,ans);

    }


    return 0;
}