【dp求期望值】POJ 3756

來源:互聯網
上載者:User

dp求期望

double dp[1024][111];//dp[i][j]第i round到j格的機率bool stop[111];int go[111];int n;int main(){    while(scanf("%d",&n) !=-1){        int i,j;        int m;        memset(go,0,sizeof(go));        memset(stop,0,sizeof(stop));        scanf("%d",&m);        while(m--){            int pos,num;            scanf("%d%d",&pos,&num);            go[pos]+=num;        }        scanf("%d",&m);        while(m--){            int pos,num;            scanf("%d%d",&pos,&num);            go[pos]-=num;        }        scanf("%d",&m);        while(m--){            int pos;            scanf("%d",&pos);            stop[pos] = true;        }        memset(dp,0,sizeof(dp));        dp[0][0] = 1.0;        double per = 1.0/6.0;        for(i=0;i<1000;i++){            for(j=0;j<n;j++){                if(dp[i][j]>0){                    for(int k=1;k<=6;k++){                        int next = k+j;                        if(next>n){                            int res = next%n;                            next = n-res;                        }                        if(stop[next]){                            dp[i+2][next] += dp[i][j]*per;                        } else {                            next += go[next];                            if(next>n){                                int res = next%n;                                next = n-res;                            } else if(next<0)next =-next;                            dp[i+1][next] += dp[i][j]*per;                        }                    }                }            }        }        double ans = 0;        for(i=0;i<1000;i++){            ans += dp[i][n]*i;        }        if(ans<eps)puts("Impossible");        else        printf("%.2lf\n",ans);    }    return 0;}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.