很简单的一道题,直接1Y。
直接扫描就可以了!
需要注意的是:
1.格式问题,是每输出完一组数据便输出一个空行!
2.循环问题:i,j两个循环变量要从同一个值开始!
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 20;
int main()
{
//freopen("a.txt","w",stdout);
int num[maxn];
int n,k,cont = 0,cont2 = 0;
while(~scanf("%d",&n)){
cont = 0;
long long maxn = 1;
long long sum = 1;
for (int i = 0; i < n; ++i)scanf("%d",&num[i]);
for (int i = 0; i < n; ++i){
for (int j = i; j < n; ++j){
sum = 1;
for (int k = i; k <= j; ++k){
sum *= num[k];
}
cont++;
if (cont == 1)maxn = sum;
if (sum > maxn)maxn = sum;
}
}
if (maxn <= 0)maxn = 0;
printf("Case #%d: The maximum product is %lld.\n",++cont2,maxn);
printf("\n");
}
return 0;
}