b917: 11059 Maximum Product
標籤 :
通過比率 : 66人/118人 ( 56% ) [非即時]
評分方式:
Strictly

最近更新 : 2018-06-02 10:35

內容

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.

輸入說明

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).

輸出說明

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.

範例輸入
3
2 4 -3
5
2 5 -1 2 -1
範例輸出
Case #1: The maximum product is 8.
Case #2: The maximum product is 20.
測資資訊:
記憶體限制: 64 MB
公開 測資點#0 (100%): 0.2s , <1M
提示 :
標籤:
出處:
[管理者:
99st60107 (林子傑)
]


編號 身分 題目 主題 人氣 發表日期
17148
wilicw (William Chang)
b917
80 2019-03-16 13:32