UVA-11059 Maximum Product
来源:互联网 发布:济南java招聘微信群 编辑:程序博客网 时间:2024/06/06 06:55
看清楚题意,连续的子序列,不能从小到大排序再乘。
#include<iostream>#include<stdio.h>#include<string.h>#include<string>#include<math.h>#include<algorithm>using namespace std;int main(){ long long max,max1;//注意范围 int N,i,y=0; while(~scanf("%d",&N)){ y++; int z[20]; for( i=0;i<N;i++){ cin>>z[i]; } max=0;//最小值为0 for(int j=0;j<N;j++){ max1=1; for( i=j;i<N;i++){ max1*=z[i]; if(max1>max) max=max1; } } printf("Case #%d: The maximum product is %lld.\n\n",y,max);//注意格式 } return 0;}
阅读全文
0 0
- UVA - 11059 Maximum Product
- UVa 11059 - Maximum Product
- UVa 11059 - Maximum Product
- UVa 11059 - Maximum Product
- Uva 11059 Maximum Product
- UVA - 11059 Maximum Product
- uva 11059 Maximum Product
- UVa 11059 Maximum Product
- Uva - 11059 - Maximum Product
- UVA - 11059 Maximum Product
- uva 11059Maximum Product
- Uva 11059 Maximum Product
- Maximum Product(UVa 11059)
- UVA 11059 Maximum Product
- UVa 11059 Maximum Product
- UVa 11059 Maximum Product
- UVa 11059 Maximum Product
- UVA 11059 - Maximum Product
- Android ADB
- 类与对象以及面向对象的概念
- 深入浅出ClassLoader
- PS(二)
- TensorFlow学习笔记:构建多分类任务模型(未完)
- UVA-11059 Maximum Product
- poj1696
- java高并发程序设计学习笔记二多线程基础
- Python环境搭建之OpenCV
- 换博客啦!!!
- 求积问题[体会Python至简之道]
- C#委托的异步调用
- 第二次作业答案(官方)
- [BZOJ4785][ZJOI2017]树状数组(树套树)