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

#include<iostream>
#include<stdio.h>
#include <stdlib.h>
#include<math.h>
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<n; i++) {
            scanf("%lf", &d);
            tmp1 = d1 * d;
            tmp2 = d2 * d;
            d1 = max(max(tmp1,tmp2),d);
            d2 = min(min(tmp1,tmp2),d);
            if(d1 > 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);
        }
    }
}