题目1501：最大连续子序列乘积

#include
#include
#include 
#include
using namespace std;
double d1, d2;
int n;
double ans, d, tmp1, tmp2;
int main() {
    while (~scanf("%d",&n))
    {
        scanf("%lf", &d1);
        ans = d2 = d1;
        for(int i=1; i ans)
            ans = d1;
        }
        int t = (int)ans;
        if(ans < 0) {
            puts("-1");
        } else {
            if(ans == t)
            printf("%d\n",t);
            else printf("%.2f\n",ans);
        }
    }
}