Discovering Gold（期望DP&骰子6面）

题目：https://vjudge.z180.cn/problem/LightOJ-1030#author=CaprYang

题意： 给n个数，然后初始站在1位置上，掷6面骰子，掷到几走几步，走到哪里，哪个位置上的数就拿起来，如果掷出的数超过了n，则重新掷，掷到n后结束游戏，问拿到的数的期望。

题解1：公式：E(n)=∑(xipi）从1到n累加起来就是走到n的期望，xipi就是走本点的概率pi乘以本点的值，代表走本点的期望，所以走到n拿起数的期望，就是从1加到n。
题解2：从前往后推貌似不行(本人也不太理解),从后往前推，fi=（ f(i+1)*pi+f(i+2)*pi ）这里的pi是从i+1/i+2走到i的概率，思想就是计算从n-1走到n的期望，计算从n-2走到n的期望~~~

题解1代码：

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <unordered_map>
//#include <unordered_set>
//#include <bits/stdc++.h>
//#define int long long
#define pb push_back
#define PII pair<int, int>
#define mpr make_pair
#define ms(a, b) memset((a), (b), sizeof(a))
#define x first
#define y second
typedef long long ll;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int N = 1e6 + 7;
using namespace std;

int a[N];
double f[N];
// signed main(){
int main(int argc, char const *argv[]) {
    int T;
    scanf("%d", &T);
    int Case = 0;
    while (T--) {
        int n;
        scanf("%d", &n);
        for (int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
        }
        f[1] = 1; //这里一定会走，所以概率是1
        for (int i = 1; i < n; i++) {
            for (int j = i + 1; j <= min(i + 6, n); j++) {
               //求走到j的概率
                if (n - i < 6) {   
                    int t = n - i;
                    f[j] += f[i] / t;
                } else
                    f[j] += f[i] / 6;
            }
        }
        double ans = 0; //记录和
        for (int i = 1; i <= n; i++) { //求走本点的期望
            ans += f[i] * a[i];
        }
        printf("Case %d: ", ++Case);
        printf("%.10lf\n", ans);
        for (int i = 1; i <= n; i++) f[i] = 0;
    }
    return 0;
}

题解2代码：

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
//#include <unordered_map>
//#include <unordered_set>
//#include <bits/stdc++.h>
//#define int long long
#define pb push_back
#define PII pair<int, int>
#define mpr make_pair
#define ms(a, b) memset((a), (b), sizeof(a))
#define x first
#define y second
typedef long long ll;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int N = 1e6 + 7;
using namespace std;

int a[N];
double f[N];
// signed main(){
int main(int argc, char const *argv[]) {
    int T;
    scanf("%d", &T);
    int Case = 0;
    while (T--) {
        int n;
        scanf("%d", &n);
        for (int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
        }
        //从后往前
        for (int i = n - 1; i >= 1; i--) {
            for (int j = 1; j <= 6; j++) {
                //想要走到i这个点，从i+j这个点的期望乘以走到i这个点的概率
                f[i] += (f[i + j] + a[i + j]) * (1.0 / min(6, n - i));
            }
        }
        printf("Case %d: ", ++Case);
        printf("%.10lf\n", f[1] + a[1]);
        for (int i = 1; i <= n; i++) f[i] = 0, a[i] = 0;
    }
    return 0;
}