#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
typedef long long ll;
using namespace std;
int main() {
int n, kase=1;
while(cin >> n) {
ll a[30], mul = 0;
for(int i=0; i<n; i++) cin >> a[i];
for(int i=0; i<n; i++) {
ll sum = 1;
for(int j=i; j<n; j++) {
sum *= a[j];
if(sum > mul) mul = sum;
}
}
printf("Case #%d: The maximum product is %lld.\n\n", kase++, mul);
}
}
本来是道水题,但是uva对格式要求非常严格,不仅是输出格式,代码格式也一样
比如这题,我用long long 定义,输出时必须要用%lld而不是%I64d 。wrong得我不要不要的!!!
ac代码