UVA 10059 - Maximum Product

最新推荐文章于 2020-08-06 14:33:42 发布

Vectors_

最新推荐文章于 2020-08-06 14:33:42 发布

阅读量456

点赞数

分类专栏：字符串、枚举

本文链接：https://blog.csdn.net/qq_15654993/article/details/75267587

版权

该问题要求在给定的整数序列中找到连续项的最大正乘积。每个序列包含1到18个元素，且元素范围在-10到10之间。输出应包含测试用例编号和最大正乘积值。

摘要由CSDN通过智能技术生成

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