最大子段的乘积

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.
English word: maximum 最大的 sequeue 一连串的 consecutive 连续的 positive number 正数
题意：
找到最大的子段乘积（为正数），如果找不到最大子段乘积为正数的子段，则其最大子段乘积为0；

#include <stdio.h>
#include <stdlib.h>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=100010;
int a[maxn];
int main()
{
    int n,k=1;
    while(cin>>n)
    {
        ll ans=0;
        for(int i=1; i<=n; i++)cin>>a[i];
        for(int i=1; i<=n; i++)
        {
            ll sum=1;
            for(int j=i; j<=n; j++)
            {
                sum*=a[j];
                ans=max(ans,sum);
            }
        }
        //找到以1为起点的最大子段
        找到以2为起点的最大子段（如果其比之前找的子段大，则更新为此子段，否则不进行更新）
        一直找到以n为起点的最大子段
        cout<<"Case "<<"#"<<k++<<": ";
        cout<<"The maximum product is ";
        cout<<ans;
        cout<<"."<<endl;
        cout<<endl;
    }
    return 0;
}