UVA11059 Maximum Product
来源:互联网 发布:ssh 知乎 编辑:程序博客网 时间:2024/06/05 16:05
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 Siisan integer such that −10 ≤ Si ≤ 10. Next line will have N integers, representing the value of eachelement in the sequence.There is a blank line after each test case. The input is terminated by end offile (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.
UVA的格式是真的牛掰!
看我加粗的两行。
一开始我以为是输入完以后输出一个空行。
在输出数据后再输出一个空行。
结果是只要后面那个,QAQ!
不多说,来说思路:
求连续子串的积,我们可以找到起点和终点即可,又因为每个元素的绝对值不超过10且只有18个元素,最大枚举数不超过10的18次方,我们可以用 long long存储即可。
#include<iostream>#include<cstdio>using namespace std;int main() {int n;int T=0;while(scanf("%d",&n)!=EOF){int a[20];long long max=0,sum=1;for(int i=0;i<n;i++){cin>>a[i];}//if(T++) cout<<"\n";T++;for(int i=0;i<n;i++){ for(int j=i;j<n;j++) { sum*=a[j]; if(sum>max) max=sum; } sum=1;} if(max<=0){ printf("Case #%d: The maximum product is %ld.\n\n",T,0);} else{ printf("Case #%d: The maximum product is %ld.\n\n",T,max);} }return 0;}
- UVa11059 Maximum Product
- UVa11059 - Maximum Product
- UVA11059 - Maximum Product
- [UVA11059]Maximum Product[暴力]
- uva11059 Maximum Product
- UVA11059-Maximum Product
- UVa11059 Maximum Product
- UVA11059 Maximum Product
- UVA11059 Maximum Product
- UVA11059 Maximum Product
- UVA11059 Maximum Product(暴力)
- 最大乘积(Maximum Product,UVa11059)
- Uva11059——Maximum Product
- [UVA11059]Maximum Product 暴力求解入门
- Maximum Product
- Maximum Product
- UVA11059
- uva11059
- Eclipse很卡的解决方法
- Swift 资源库
- 题目:poj – 2395 (B题)
- 手工方式实现Spring工厂创建对象
- SlickEdit Pro(文本编辑器) v20.0.0.12 免费版
- UVA11059 Maximum Product
- VS中关于.h和.lib丢失的配置问题
- Service学习理解
- 解决myeclipse2014 中使用低版本的maven插件
- 绝对值排序 oj36
- 常见数据类型最值
- 编译apprtc 出现如下错误 File "./build/build_app_engine_package.py"
- gradle常见问题总结
- 斜率优化dp小结