[HDU4336]Card Collector(min-max容斥,最值反演)

Card Collector

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5254    Accepted Submission(s): 2676
Special Judge

Problem Description

In
your childhood, do you crazy for collecting the beautiful cards in the
snacks? They said that, for example, if you collect all the 108 people
in the famous novel Water Margin, you will win an amazing award.

As
a smart boy, you notice that to win the award, you must buy much more
snacks than it seems to be. To convince your friends not to waste money
any more, you should find the expected number of snacks one should buy
to collect a full suit of cards.

 

Input

The
first line of each test case contains one integer N (1 <= N <=
20), indicating the number of different cards you need the collect. The
second line contains N numbers p1, p2, ..., pN, (p1 + p2 + ... + pN
<= 1), indicating the possibility of each card to appear in a bag of
snacks.

Note there is at most one card in a bag of snacks. And it is possible that there is nothing in the bag.

 

Output

Output one number for each test case, indicating the expected number of bags to buy to collect all the N different cards.

You will get accepted if the difference between your answer and the standard answer is no more that 10^-4.

 

Sample Input

1
0.1
2
0.1 0.4

 

Sample Output

10.000
10.500

 

Source

2012 Multi-University Training Contest 4

 

Recommend

zhoujiaqi2010   |   We have carefully selected several similar problems for you:  4337 4331 4332 4333 4334 

 

Statistic | Submit | Discuss | Note

首先状压DP很显然，就是$f_S=\frac{1+\sum_{i\subseteq S}p_i f_{S\cup i}}{1-\sum_{i\subseteq S}p_i}$

时间$O(2^n*n)$，空间$O(2^n)$。

引入最值反演：$\max\{S\}=\sum_{T\subseteq S}(-1)^{|T|+1}min\{T\}$。

这个式子里的$\max\{S\}$可以表示集合中最大的数，也可以表示集合中最后一个出现的数（因为按照出现顺序标号就成了求最大数了）。

min-max容斥其实就是最值反演，考虑这样一类问题，每个元素有出现概率，求某个集合最后一个出现的元素所需次数的期望。

$E[\max\{S\}]=\sum_{T\subseteq S}(-1)^{|T|+1}E[min\{T\}]$

考虑$E[min\{T\}]$怎么求，实际上就是求集合中出现任意一个元素的概率的倒数，也就是$\frac{1}{\sum_{i\in T}p_i}$

这样只需枚举全集的子集即可。复杂度优化很多。

时间$O(2^n)$，空间$O(n)$。

 #include<cstdio>
 #include<algorithm>
 #define rep(i,l,r) for (int i=l; i<=r; i++)
 typedef double db;
 using namespace std;

 const int N=;
 const db eps=1e-;
 db a[N],ans;
 int n;

 void dfs(int x,db sum,int k){
     if (x>n) { if (sum>=eps) ans+=(db)k/sum; return; }
     dfs(x+,sum,k); dfs(x+,sum+a[x],-k);
 }

 int main(){
     while (~scanf("%d",&n)){
         ans=; rep(i,,n) scanf("%lf",&a[i]);
         dfs(,,-); printf("%.10lf\n",ans);
     }
     return ;
 }