例题7-2(uva-11059)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
int main()
{
	int arr[20], len,cnt = 0;
	while (cin >> len && len) {
		for (int i = 0; i < len; i++) {
			cin >> arr[i];
		}
		long long int  ret = 0,base = 0;
		for (int i = 0; i < len; i++) {
			base = 1;
			for (int j = i; j < len; j++) {
				base *= arr[j];
				ret = max(ret, base);
			}
		}
		cout << "Case #"<<++cnt<<": The maximum product is "<< ret<<"."<<endl<<endl;
	}
	return 0;
}