codeforces#253 D - Andrey and Problem

Andrey and Problem Crawling in process... Description Andrey needs one more problem to conduct a programming contest. He has n friends who are always willing to help. He can ask some of them to come up with a contest problem. Andrey knows one value for each of his fiends — the probability that this friend will come up with a problem if Andrey asks him. Help Andrey choose people to ask. As he needs only one problem, Andrey is going to be really upset if no one comes up with a problem or if he gets more than one problem from his friends. You need to choose such a set of people that maximizes the chances of Andrey not getting upset. Input The first line contains a single integer n(1 ≤ n ≤ 100) — the number of Andrey's friends. The second line contains n real numbers pi(0.0 ≤ pi ≤ 1.0) — the probability that the i-th friend can come up with a problem. The probabilities are given with at most 6 digits after decimal point. Output Print a single real number — the probability that Andrey won't get upset at the optimal choice of friends. The answer will be considered valid if it differs from the correct one by at most 10 - 9. Sample Input Input 4 0.1 0.2 0.3 0.8 Output 0.800000000000 Input 2 0.1 0.2 Output 0.260000000000 Hint In the first sample the best strategy for Andrey is to ask only one of his friends, the most reliable one. In the second sample the best strategy for Andrey is to ask all of his friends to come up with a problem. Then the probability that he will get exactly one problem is 0.1·0.8 + 0.9·0.2 = 0.26.

    （转）Andrey想让朋友出题，他知道每个朋友出题的概率，他只想要一道题，并且想要实现的概率最大。

假设总共有n件事件，

从中选择1件事情去做，实现的概率最大是多少，

选择2件事情去做，实现的概率最大是多少，以此类推到选择n件事情去做。

于是就会得到n个结果，里面最大的那个就是实现主人公想法的最大概率。

这样的话要从n件事件中任意选出1件事情然后比概率，任意选出2件事情然后比概率……任意选出n件事情然后比概率

还是要搜索。

但是这里就有数学知识了，可以不用搜索，做法是这样的：

将n个事件成功的概率从大到小排序，

然后，

只选择前1件事去做成功的概率就是“从中选择1件事情去做，最大的实现概率”

只选择前2件事去做成功的概率就是“从中选择2件事情去做，最大的实现概率”

以此类推。

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
    double a[102];
    int n;
    cin>>n;
    for (int i=0; i<n; i++)
    {
        cin>>a[i];
    }
    sort(a, a+n,greater<double>());
    double sum;
    double Max=0;
    double ans=0;
    for (int i=1; i<=n; i++)
    {
        sum=0;
        for (int j=0; j<i; j++)  //依次取一个，两个，。。。i个
        {
            ans=a[j];
            for (int k=0; k<i; k++)
            {
                if(j!=k)
                {
                    ans*=(1-a[k]);
                }
            }
            sum+=ans;
        }
        Max=max(Max,sum);
    }
    printf("%.12lf\n",Max);
    return 0;
}