Maximum Product Max Product

Given a sequence of integers S = {S1, S2, ..., Sn}, you should determine what is the value of the maximum Positiv E 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 is starts with 1≤n≤18, and the number of elements in a sequence. Each element Si is a integer such that -10≤si≤10. Next Line would has 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, 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++)
		scanf ("%d", &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);
	}
	return 0;
}