SDNU——8题——C - 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.

 #include<iostream>  
#include<cstdio>  
using namespace std;  
long long num[100];  
  
int main()  
{  
    int n;  
    int cnt = 0;  
    while (cin >> n)  
    {  
        long long ans = 0;  
        for (int i = 0; i < n; ++i)  
            cin >> num[i];  
        for (int i = 1; i <= n; ++i) //i:子序列长度   
        {  
            for (int j = 0; j + i <= n; ++j) //j:子序列起点 （这里之前写j + i < n，怒跪）   
            {  
                long long tt = 1;  
                for (int k = j; k < j + i; ++k) //累乘   
                {  
                    tt *= num[k];  
                }  
                //cout << tt << endl;  
                ans = max(ans, tt);  
            }  
        }  
        printf("Case #%d: The maximum product is %lld.\n\n", ++cnt, ans);  
    }  
    return 0;  
}  

求最大连续乘积

暴力（连续）~~我只需要把没种情况都考虑一下就odk~~~每种情况说白也就是起点和终点都考虑一下~~

注意输出格式

注意情况数据~(我的代码思路和上面一样)，但一定时细节没有处理好，没有A，所以先给你们看看网友大佬的代码，等我找到错我，再补上~~~