UVA 11059 Maximum Product

Given a sequence of integers S = {S1, S2, . . . , Sn}, 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 Si
is
an integer such that −10 ≤ Si ≤ 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.

错了5次。。。没注意输出0时的格式问题

#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;


int main()
{
    int n;
    int kase=0;
    while(scanf("%d",&n)!=EOF)
    {
        int co=n*(n-1)/2+n;
        long long pro[co];
        //cout<<co<<endl;
        int a[n];
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
        }
        getchar();
        int k=0;

        for(int i=0;i<n;i++)
        {
            long long pr=1;
            for(int j=i;j<n;j++)
            {
                pr*=a[j];
                pro[k++]=pr;
            }
        }
        long long maxx=pro[0];
        for(int i=0;i<co;i++)
        {
            //cout<<pro[i]<<"\t";
            if(pro[i]>maxx)
                maxx=pro[i];
        }
        if(maxx>0)
            cout<<"Case #"<<++kase<<": The maximum product is "<<maxx<<"."<<endl<<endl;
        else
            cout<<"Case #"<<++kase<<": The maximum product is 0."<<endl<<endl;
    }
}