标签：possible sum eve nbsp clipboard file visit -o art
Maxim has opened his own restaurant! The restaurant has got a huge table, the table‘s length is p meters.
Maxim has got a dinner party tonight, n guests will come to him. Let‘s index the guests of Maxim‘s restaurant from 1 to n. Maxim knows the sizes of all guests that are going to come to him. The i-th guest‘s size (ai) represents the number of meters the guest is going to take up if he sits at the restaurant table.
Long before the dinner, the guests line up in a queue in front of the restaurant in some order. Then Maxim lets the guests in, one by one. Maxim stops letting the guests in when there is no place at the restaurant table for another guest in the queue. There is no place at the restaurant table for another guest in the queue, if the sum of sizes of all guests in the restaurant plus the size of this guest from the queue is larger than p. In this case, not to offend the guest who has no place at the table, Maxim doesn‘t let any other guest in the restaurant, even if one of the following guests in the queue would have fit in at the table.
Maxim is now wondering, what is the average number of visitors who have come to the restaurant for all possible n! orders of guests in the queue. Help Maxim, calculate this number.
The first line contains integer n (1 ≤ n ≤ 50) — the number of guests in the restaurant. The next line contains integers a1, a2, ..., an(1 ≤ ai ≤ 50) — the guests‘ sizes in meters. The third line contains integer p (1 ≤ p ≤ 50) — the table‘s length in meters.
The numbers in the lines are separated by single spaces.
In a single line print a real number — the answer to the problem. The answer will be considered correct, if the absolute or relative error doesn‘t exceed 10 - 4.
3
1 2 3
3
1.3333333333
In the first sample the people will come in the following orders:
In total we get (2 + 1 + 2 + 1 + 1 + 1) / 6 = 8 / 6 = 1.(3).
题解：
令dp[i][j][k]表示前i个取j个和为k的期望
考虑转移到i的时候，无非是a[i]取或者不取
取的次数占总次数的比为c(i-1,j-1)/c(i,j)=j/i
所以不取的占比为1-j/i=(i-j)/i
故得到转移方程
dp[i][j][k]=j/i*dp[i-1][j-1][k-a[i]]+(i-j)/i*dp[i-1][j][k]
代码如下：
#include<bits/stdc++.h> using namespace std; double dp[66][66][66]; double fac[66]; int n,p,a[66]; int main() { dp[0][0][0]=1.0; scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i]); scanf("%d",&p); for(int i=1;i<=n;i++) { for(int j=0;j<=i;j++) { for(int k=0;k<=p;k++) { dp[i][j][k]+=dp[i-1][j][k]*(i-j)/i; if(k-a[i]>=0) { dp[i][j][k]+=dp[i-1][j-1][k-a[i]]*j/i; } } } } double ans=0.0; for(int i=1;i<=n;i++) { for(int j=1;j<=p;j++) { ans+=dp[n][i][j]; } } printf("%.5lf\n",ans); }
codeforces 261B Maxim and Restaurant(概率DP)
标签：possible sum eve nbsp clipboard file visit -o art
原文地址：https://www.cnblogs.com/stxy-ferryman/p/9867733.html
