Maximum Product

最新推荐文章于 2022-01-23 22:37:10 发布

Wonder__

最新推荐文章于 2022-01-23 22:37:10 发布

阅读量184

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/Wonder__/article/details/79743303

本文介绍了一个算法问题，即给定一个整数序列，如何找出该序列中连续子序列的最大正乘积，并提供了一段C语言实现代码作为示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

2 4 -3

2 5 -1 2 -1

Sample Output

Case #1: The maximum product is 8.

Case #2: The maximum product is 20

#include<stdio.h>
#include<string.h>

int s[20];

int main()
{
int cas = 1;
int n;

while(~scanf("%d",&n))
{
for(int i=0; i<n; i++)
{
scanf("%d",&s[i]);
}
long long maxn = 0;
long long sum;
for(int i=0; i<n; i++)///起点
{
for(int j=i; j<n; j++)///终点
{
sum = 1;

for(int k=i; k<=j; k++)///查找范围
{
sum *= s[k];
}
if(sum > maxn)///更新数据
{
maxn = sum;
}
}
}
printf("Case #%d: The maximum product is %lld.\n\n",cas++,maxn);
}
}