Maximum Product UVA - 11059

#include <iostream>
#include <bits/stdc++.h>
#define maxn 20
#define ll long long
using namespace std;
ll num[maxn];

int main()
{
    int n;
    int kase = 0;
    ll ans;
    ll temp;
    while(cin>>n&&n)
    {
        ans = 0;
        for(int i = 0;i<n;i++)
            cin>>num[i];
        for(int i = 0;i<n;i++)
        {
            temp = num[i];
            ans = max(ans,temp);
            for(int j = i+1;j<n;j++)
            {
                temp*=num[j];
                ans = max(ans,temp);
            }
        }
        printf("Case #%d: The maximum product is %lld.\n\n",++kase,ans);
    }
    return 0;
}