题号：NC214665
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
Give you n real numbers（实数）, each of which is greater than 0 and less than 2, find the largest product （乘积）of the continuous subsegment（这n个数中连续的一段）
输入描述:
input n(n<=10^5) in the first line
Next n lines, input a number for each line
输出描述:
Output a number with two decimal places(保留两位小数)
示例1
输入
复制
10
1.24237
1.13899
0.7366
1.21042
1.28331
0.84378
1.27088
1.21075
0.73157
1.7932
备注:
Guarantee the answer will not exceed 10 million