#include<iostream>
#include<vector>
using namespace std;
vector<int> a;
int main()
{
int n, b, k = 0;
while(cin >> n){
for(int i=0; i<n; i++) { cin >> b; a.push_back(b); }
long long y = 1, maxy = 0;
for(int i=0; i<n; i++){
y = 1;
for(int j=i; j<n; j++){
y *= a[j];
maxy = max(maxy,y);
}
}
cout << "Case #" << ++k << ": The maximum product is " << maxy << ".\n\n";
a.clear();
}
return 0;
}
UVa11059 - Maximum Product
最新推荐文章于 2016-11-07 21:02:39 发布