11059:Maximum Product

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_37754288/article/details/81664365

Maximum Product

#include<bits/stdc++.h>
using namespace std;
const int maxn = 20;
int n;
int seq[maxn];
int main()
{
    // freopen("data.in","r",stdin);
    // freopen("data.out","w",stdout);
    int kase = 0;
    while(scanf("%d",&n) != EOF){
        for(int i = 0;i < n;i++) scanf("%d",&seq[i]);
        long long p = 0;
        for(int i = 0;i < n;i++){
            for(int j = i;j < n;j++){
                long long t = 1;
                for(int k = i;k <= j;k++) t *= seq[k];
                p = max(p,t);
            }
        }
        printf("Case #%d: The maximum product is %lld.\n\n",++kase,p);
    }
    return 0;
}