1030 - Discovering Gold 期望dp--从后往前推

You are in a cave, a long cave! The cave can be represented by a 1 x N grid. Each cell of the cave can contain any amount of gold.

Initially you are in position 1. Now each turn you throw a perfect 6 sided dice. If you get X in the dice after throwing, you add X to your position and collect all the gold from the new position. If your new position is outside the cave, then you keep throwing again until you get a suitable result. When you reach the Nth position you stop your journey. Now you are given the information about the cave, you have to find out the expected number of gold you can collect using the given procedure.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case contains a blank line and an integer N (1 ≤ N ≤ 100) denoting the dimension of the cave. The next line contains N space separated integers. The ith integer of this line denotes the amount of gold you will get if you come to the ith cell. You may safely assume that all the given integers will be non-negative and no integer will be greater than 1000.

Output

For each case, print the case number and the expected number of gold you will collect. Errors less than 10-6 will be ignored.

Sample Input	Output for Sample Input
3   1 101   2 10 3   3 3 6 9	Case 1: 101.0000000000 Case 2: 13.000 Case 3: 15

 

---

PROBLEM SETTER: JANE ALAM JAN

每次摇一骰子，按照此刻位置加X走，走过线重摇。每个点都有一定金子，求获得的金子的期望。

从后往前推，“为啥是逆求呢，如果正求是在前面期望的基础之上求期望。期望的期望只是一种可能性，并不符合概率要求”

参考：https://blog.csdn.net/yopilipala/article/details/78997211

#include<bits/stdc++.h>
# define ll long long
using namespace std;
double dp[100000];
double a[100000];
int main()
{
    int t;
    cin>>t;
    for(int o=1;o<=t;o++)
    {
        int n;
        cin>>n;
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
            dp[i]=a[i];
        }
        /*
        求期望要从后往前推理，具体...
        */
        int count=1;
        for(int i=n-1;i>=1;i--)
        {
            if(count>6)count=6;
            for(int j=1;j<=count;j++)
            {
                dp[i]+=dp[i+j]*1.0/count;
            }
            count++;
            /*
            第i个点的期望就是它之后的加上他的期望和
            */
        }
        printf("Case %d: %.8lf\n",o,dp[1]);
    }
}