ZOJ3640—-Help Me Escape

Background

    If thou doest well, shalt thou not be accepted? and if thou doest not well, sin lieth at the door. And unto thee shall be his desire, and thou shalt rule over him.
    And Cain talked with Abel his brother: and it came to pass, when they were in the field, that Cain rose up against Abel his brother, and slew him.
    And the LORD said unto Cain, Where is Abel thy brother? And he said, I know not: Am I my brother’s keeper?
    And he said, What hast thou done? the voice of thy brother’s blood crieth unto me from the ground.
    And now art thou cursed from the earth, which hath opened her mouth to receive thy brother’s blood from thy hand;
    When thou tillest the ground, it shall not henceforth yield unto thee her strength; a fugitive and a vagabond shalt thou be in the earth.

—— Bible Chapter 4

Now Cain is unexpectedly trapped in a cave with N paths. Due to LORD’s punishment, all the paths are zigzag and dangerous. The difficulty of the ith path is ci.

Then we define f as the fighting capacity of Cain. Every day, Cain will be sent to one of the N paths randomly.

Suppose Cain is in front of the ith path. He can successfully take ti days to escape from the cave as long as his fighting capacity f is larger than ci. Otherwise, he has to keep trying day after day. However, if Cain failed to escape, his fighting capacity would increase ci as the result of actual combat. (A kindly reminder: Cain will never died.)

As for ti, we can easily draw a conclusion that ti is closely related to ci. Let’s use the following function to describe their relationship:

After D days, Cain finally escapes from the cave. Please output the expectation of D.

Input

The input consists of several cases.In each case, two positive integers N and f (n ≤ 100, f ≤ 10000) are given in the first line. The second line includes N positive integers ci (ci ≤ 10000, 1 ≤ i ≤ N)

Output

For each case, you should output the expectation(3 digits after the decimal point).

简单的概率dp, 设dp[i]表示fight值为i时逃离所需要的天数的期望值

然后记忆化搜索搞一下就行了  dp[f]就是最后的答案

/*************************************************************************     > File Name: zoj3640.cpp     > Author: ALex     > Mail: 405045132@qq.com      > Created Time: 2014年12月20日 星期六 14时20分08秒  ************************************************************************/  #include <map> #include <set> #include <queue> #include <stack> #include <vector> #include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <algorithm> using namespace std;  const int N = 20010; double dp[N]; int t[110]; int c[110], n;  double dfs(int f) {  if (dp[f] != -1)  {   return dp[f];   }  double ans = 0;  for (int i = 1; i <= n; i++)  {   if (f > c[i])   {    ans += (1.0 / n) * t[i];   }   else   {    ans += (1.0 / n) * (1 + dfs(f + c[i]));   }  }  return dp[f] = ans; }  int main() {  int f;  double gold = (sqrt(5.0) + 1) / 2;  while (~scanf("%d%d", &n, &f))  {   for (int i = 1; i <= n; i++)   {    scanf("%d", &c[i]);    t[i] = int(c[i] * c[i] * gold); //   printf("%d/n", t[i]);   }   for (int i = 0; i <= N; i++)   {    dp[i] = -1;   }   printf("%.3f/n", dfs(f));  }  return 0; }