例题7-2 UVA11059 最大乘积 Maximum Product

难度：2

这是暴力题，但是刘汝佳都没有讲，就说可以从两头扫描，就一句话，合着要手推双指针是吧，

#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;

int main() {
    int n;
    int t = 1;
    while (cin >> n) {
        ll a[20];
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
        ll ans = 0;
        for (int l = 1; l <= n; l++) {
            for (int i = 0; i <= n - l; i++) {
                ll temp = 1;
                for (int j = i; j < i + l; j++) {
                    temp *= a[j];
                }
                if (temp > ans) ans = temp;
            }
        }
        cout << "Case #" << t++ << ": The maximum product is " << ans << ".\n\n";
    }
    return 0;
}