UVa 11059(枚举)
来源:互联网 发布:hadoop能用python吗 编辑:程序博客网 时间:2024/06/04 15:39
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
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.
//思路:连续子序列有两个要素:起点和终点,因此只需枚举起点和终点即可。
AC源码:
#include <iostream>#include <cmath>#include <cstdio>using namespace std;typedef long long LL;#define LOCALconst int MAXN=25;int A[MAXN],n;LL solve(){LL ans=-(1e15);for(int i=0;i<n;++i){for(int j=i;j<n;++j){LL sum=1;for(int k=i;k<=j;++k)sum*=A[k];ans=max(max(sum,ans),(LL)0);}}return ans;}int main(){#ifdef LOCALfreopen("data.in","r",stdin);freopen("data.out","w",stdout);#endifint kase=1;while(~scanf("%d",&n)){int tmp;for(int i=0;i<n;++i){scanf("%d",&tmp);A[i]=tmp;}printf("Case #%d: The maximum product is %lld.\n\n",kase++,solve());}return 0;}
- UVA 11059 枚举
- UVa 11059(枚举)
- UVa--11059 Maxumum Produce(枚举)
- UVa - 11059 - Maximum Product(枚举)
- UVA - 11059 Maximum Product (简单枚举)
- (暴力枚举) UVa 11059 Maximum Product
- UVa 11059 最大乘积(枚举)
- Uva 11059 Maximum Product(简单枚举)
- uva 10167 枚举
- UVA 585 - Triangles(枚举)
- uva 10730 - Antiarithmetic?(枚举)
- uva 11205(枚举子集)
- uva 131(枚举子集)
- uva 565(暴力+枚举)
- UVa 654 - Ratio (枚举)
- UVa 725----Division(枚举)
- UVa 201 Squares 枚举
- UVa 1509 Leet 枚举
- BZOJ 1925: [Sdoi2010]地精部落 dp
- python的pygame涉猎
- zookeeper单机伪集群配置
- [leetcode]128. Longest Consecutive Sequence
- java反射应用
- UVa 11059(枚举)
- windows 7安装CartoCss
- CS231n+assignment1(作业一)
- SpringMVC上传文件的简单代码实例
- 高效程序员的特征
- 《Keyword Search over RDF Graphs》——读书笔记
- Java实现-删除元素
- 用户体验总结
- 详解C#中的反射