hdu5504 GT and sequence(BestCoder Round #60 )
来源:互联网 发布:按option无法切换mac 编辑:程序博客网 时间:2024/05/20 13:17
GT and sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 334 Accepted Submission(s): 85
Problem Description
You are given a sequence of N integers.
You should choose some numbers(at least one),and make the product of them as big as possible.
It guaranteed that **the absolute value of** any product of the numbers you choose in the initial sequence will not bigger than263−1 .
You should choose some numbers(at least one),and make the product of them as big as possible.
It guaranteed that **the absolute value of** any product of the numbers you choose in the initial sequence will not bigger than
Input
In the first line there is a number T (test numbers).
For each test,in the first line there is a numberN ,and in the next line there are N numbers.
1≤T≤1000
1≤N≤62
You'd better print the enter in the last line when you hack others.
You'd better not print space in the last of each line when you hack others.
For each test,in the first line there is a number
You'd better print the enter in the last line when you hack others.
You'd better not print space in the last of each line when you hack others.
Output
For each test case,output the answer.
Sample Input
131 2 3
Sample Output
6
Source
BestCoder Round #60
题意:给定一个序列,从中选出任意个数的乘积最大值。
分析:此题太多坑,得慢慢发现。。
#include <iostream>#include <cstdio>#include <cstring>#include <stack>#include <queue>#include <map>#include <set>#include <vector>#include <cmath>#include <algorithm>using namespace std;const double eps = 1e-6;const double pi = acos(-1.0);const int INF = 0x3f3f3f3f;const int MOD = 1000000007;#define ll long long#define CL(a) memset(a,0,sizeof(a))int main(){ int T; ll n,x,sum; cin>>T; while(T--) { cin>>n; sum = 0; int k=0,re=0; ll maxx = -INF; for(int i=0; i<n; i++) { cin>>x; if(x == 0) {re++; continue;} if(x < 0) { k++; maxx = max(maxx, x); } if(i == re) sum = x; else sum *= x; } //cout<<re<<" "<<k<<endl; if(k%2&&n!=1&&!(k==1&&re+k==n)) sum /= maxx; if(re>0&&(sum<0||n==1)) sum = 0; cout<<sum<<endl; } return 0;}
0 0
- BestCoder Round #60 HDU5504 GT and sequence
- hdu5504 GT and sequence(BestCoder Round #60 )
- hdu5504 GT and sequence
- hdu5504 GT and sequence
- hdu5504 GT and sequence
- BestCoder Round #60 GT and sequence (排序)
- hdu 5504 GT and sequence【BestCoder Round #60 】
- BestCoder Round #60 GT and numbers (模拟)
- BestCoder Round #60 GT and set (dfs)
- hdu5505 GT and numbers(BestCoder Round #60)
- BestCoder Round #60 HDU5505 GT and numbers
- BestCoder Round #60 5505GT and numbers
- GT and numbers(BestCoder Round #60)1002
- HDU 5504 GT and sequence(排除陷阱就是正解)——BestCoder Round #60
- hdu 5505 GT and numbers【BestCoder Round #60】
- BestCoder Round #3 BestCoder Sequence
- [BestCoder Round #3] hdu 4908 BestCoder Sequence (计数)
- hdu4908 & BestCoder Round #3 BestCoder Sequence(组合数学)
- 关于PHP实现迭代器和迭代
- Java的强制类型转换与隐式类型转换
- 黑马程序员——Java对象
- LeetCode 17 Letter Combinations of a Phone Number(电话号码的字母组合)
- Masonry介绍与使用实践:快速上手Autolayout
- hdu5504 GT and sequence(BestCoder Round #60 )
- hdu5505(好题)
- 两个线程按特定时间顺序交替执行
- softMax(2)---predict实现
- hdu1251 统计难题 字典树
- 基站定位属性
- 网络获取json解析
- Linux vi指令详解
- Winpcap 链接 VS2013 小提示