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.
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.
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.
4 0.1 0.2 0.3 0.8
0.800000000000
2 0.1 0.2
0.260000000000
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.
题目大意:
给你N个人可能出题的概率,现在你需要找这N个人中的某些人给你出题,你希望得到一个题的概率尽可能的高,问这个最大的概率是多少。
思路:
很明显的概率dp模型,我们设定dp【i】表示从【1~i】中选取某些人进行出题得到一个题的最大概率。那么有:
dp【i】=dp【j】*(1-a【i】)+sum【j】*a【i】;【1<=j<i】
这里sum【j】表示的就是对应dp【j】的最优解的时候,选择的那些人的出题概率乘积。
但是这里如果直接这样跑是会Wa的,我们需要对概率从大到小排序后,再跑dp维护最大值。
为什么呢?因为dp【i】的概率是要取决于sum【j】的.dp【j】明显是固定的一个结果,但是sum【j】会随着dp【j】走的,也就是说,如果我们从大到小排序后,sum【j】是足够大的,所以此时更新dp【i】的机会就会更多,所以能够带来更优。
所以我们应该对a【i】从大到小排序后,再考虑dp、
Ac代码:
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
/*
3
0.388818 0.399762 0.393874
*/
double a[10000];
double dp[10000];
double sum[10000];
int main()
{
int n;
while(~scanf("%d",&n))
{
for(int i=1;i<=n;i++)scanf("%lf",&a[i]);
sort(a+1,a+1+n);
reverse(a+1,a+1+n);
for(int i=1;i<=n;i++)dp[i]=a[i],sum[i]=(1-a[i]);
for(int i=2;i<=n;i++)
{
for(int j=1;j<i;j++)
{
if(dp[i]<(dp[j]*(1-a[i])+sum[j]*a[i]))
{
dp[i]=(dp[j]*(1-a[i])+sum[j]*a[i]);
sum[i]=sum[j]*(1-a[i]);
}
}
}
double output=0;
for(int i=1;i<=n;i++)output=max(output,dp[i]);
printf("%.12lf\n",output);
}
}