题目大意:有n条路可以选择,随机选择,选择了这条路时有一条规则,假如攻击力f大于了这条路的ci,那么可以从这条路逃出去,花费ti(有对应公式计算)
假如小于等于该值,则花费一天,并且攻击力增加ci,重复刚才的操作。问最终的期望是多少。
思路:
dp[i]表示的是攻击力为i的情况下,出去的期望。
根据期望的概念可以得
状态方程:dp[i]+=(1+dp[i+c[i])/n (当攻击力小于等于c[i])
dp[i]+=t[i]/n (当攻击力大于c[i])
可以用一般递推去做,也可以用记忆化搜索,AC代码:
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int p[10005];
double dp[20005];
int c[110];
int n,f;
/*
记忆搜索
*/
double gao(int k)
{
double &ans = dp[k];
if (ans != 0)return ans;
ans = 0;
for (int i = 1; i <= n;i++)
if (k > c[i])
ans += p[i] / (1.0*n);
else
ans += (1 + gao(k + c[i])) / (1.0*n);
return ans;
}
int main()
{
while (cin >> n >> f)
{
double mid = (1.0 + sqrt(5.0)) / 2;
for (int i = 1; i <= n; i++)
scanf("%d", &c[i]);
memset(dp, 0, sizeof(dp));
sort(c + 1, c + 1 + n);
for (int i = 1; i <= n; i++)
p[i] = c[i] * c[i] * mid;
gao(f);
/*
一般递推方法如下:
*/
/*int mid2 = c[n] + 1;
dp[mid2] = 0;
for (int i = 1; i <= n; i++)
dp[mid2] += p[i];
dp[mid2] /= n;
if (f > c[n])
{
printf("%.3lf\n", dp[mid2]);
continue;
}*/
/*int k = c[n] << 1;
for (int i = c[n] + 1; i <= k; i++)
dp[i] = dp[mid2];
for (int i = c[n]; i >= f; i--)
for (int j = 1; j <= n; j++)
if (i <= c[j])
dp[i] += (1.0 + dp[i + c[j]]) / n;
else
dp[i] += p[j] / (1.0*n);*/
printf("%.3lf\n", dp[f]);
}
}