Codeforces Round #253 (Div. 2) D. Andrey and Problem

关于证明可以参考题解http://codeforces.com/blog/entry/12739

就是将概率从大到小排序然后，然后从大到小计算概率

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <cstdio>
using namespace std;

int main(){
    int n;
    cin >> n;
    vector<double> p(n);
    for(int i =  ; i < n ; ++ i) cin>> p[i];
    sort(p.begin(),p.end(), greater<double>());
    double P= ,S=1.0, res = 0.0;
    if(-p[] < 1e-) res =  1.0;
    else{
        for(int i =  ; i < n; ++ i){
            P +=p[i]/(-p[i]);
            S *=(-p[i]);
            res = max(res,P*S);
        }
    }
    printf("%.10f\n",res);
}