b917. 11059 Maximum Product
標籤 :
通過比率 : 342人/469人 ( 73% ) [非即時]
評分方式:
Strictly

最近更新 : 2020-01-20 14:43

內容

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.

範例輸入 #1
3
2 4 -3
5
2 5 -1 2 -1
範例輸出 #1
Case #1: The maximum product is 8.

Case #2: The maximum product is 20.
測資資訊:
記憶體限制: 64 MB
提示 :

2020.01.20 已題敘重點用粗題表示

標籤:
出處:
[管理者: 99st60107 (林子傑) ]

本題狀況 本題討論 排行

編號 身分 題目 主題 人氣 發表日期
37435 john1100729@ ... (靖諺) b917
398 2023-09-08 20:46
41066 toseanlin@gm ... (Dr. SeanXD) b917
C++詳解
118 2024-06-30 09:30
17148 wilicw (William Chang) b917
1591 2019-03-16 13:32