UVA - 11059(暴力水题)

Given a sequence of integers S = {S1, S2, … , Sn}, you should determine what is the value of the
maximum positive product involving consecutive terms of S. If you cannot find a positive sequence,
you should consider 0 as the value of the maximum product.
Input
Each test case starts with 1 ≤ N ≤ 18, the number of elements in a sequence. Each element Si
is
an integer such that −10 ≤ Si ≤ 10. Next line will have N integers, representing the value of each
element in the sequence. There is a blank line after each test case. The input is terminated by end of
file (EOF).
Output
For each test case you must print the message: ‘Case #M: The maximum product is P.’, where
M is the number of the test case, starting from 1, and P is the value of the maximum product. After
each test case you must print a blank line.
Sample Input
3
2 4 -3
5
2 5 -1 2 -1
Sample Output
Case #1: The maximum product is 8.
Case #2: The maximum product is 20.

水题直接上代码

#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <map>#include <queue>#include <cmath>using namespace std;const int maxn = 20 + 5;int main(){    int num = 0, n, a[maxn];    long long p = 1, pmax = 0;    while (cin >> n) {        memset (a, 0, sizeof(a));        pmax = 0;        for (int i = 0; i < n; i++) {            cin >> a[i];        }        for (int i = 0; i < n; i++) {            p = 1;            for (int j = i; j < n; j++) {                p *= a[j];                if (p > pmax) {                    pmax = p;                }            }        }        printf ("Case #%d: The maximum product is %lld.\n\n", ++num, pmax);    }    return 0;}