UVA - 11059

Problem D - Maximum Product

Time Limit: 1 second

 

 

Given a sequence of integers S = {S₁, S₂, ..., S_n}, you should determine what is the value of the maximum positive product involving consecutive terms of S. If you cannot find a positive sequence, you should consider 0 as the value of the maximum product.

Input

Each test case starts with 1 ≤ N ≤ 18, the number of elements in a sequence. Each element S_i is an integer such that -10 ≤ S_i ≤ 10. Next line will have N integers, representing the value of each element in the sequence. There is a blank line after each test case. The input is terminated by end of file (EOF).

Output

For each test case you must print the message: Case #M: The maximum product is P., where M is the number of the test case, starting from 1, and P is the value of the maximum product. After each test case you must print a blank line.

Sample Input

3
2 4 -3

5
2 5 -1 2 -1

Sample Output

Case #1: The maximum product is 8.

Case #2: The maximum product is 20.

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

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