原题链接：https://vjudge.net/problem/UVA-11059
分类：暴力求解
备注：枚举连续子序列
代码如下：
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 20;
ll a[maxn], kase;
int main(void) {
int n;
while (~scanf("%d", &n)) {
ll ans = 0;
for (int i = 0; i < n; i++)
scanf("%lld", &a[i]);
for (int i = 0; i < n; i++)
for (int j = i; j < n; j++) {
ll sum = 1;
for (int k = i; k <= j; k++)
sum *= a[k];
ans = max(ans, sum);
}
printf("Case #%lld: The maximum product is %lld.\n\n", ++kase, ans);
}
return 0;
}
