BZOJ4008: [HNOI2015]亚瑟王(期望dp)

题解

期望dp 但是这题要往概率去想转移方程。
设$dp[i][j]$表示轮到第i张牌时轮完还是j轮的概率
这种情况下第i张牌发动技能的概率是$dp[i-1][j+1]\ast (1-(1-p[i]{)}^j+1)$
其意思就是这j轮中存在一次发动技能
另一种则是j轮都没发动技能，概率位$dp[i-1][j]\ast (1-p[i]{)}^j$
而期望则是第一种情况的概率乘dps[i],第二种情况的概率乘0

代码：

#include <map>
#include <set>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <ctime>
#include <string>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
//#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define PB push_back
#define MP make_pair
#define INF 1073741824
#define inf 1152921504606846976
#define pi 3.14159265358979323846
//#pragma comment(linker,"/STACK:10240000,10240000")
//mt19937 rand_(time(0));
const int N=3e5+7,M=2e6;
const long long mod=1e9+7;
inline int read(){int ret=0;char ch=getchar();bool f=1;for(;!isdigit(ch);ch=getchar()) f^=!(ch^'-');for(;isdigit(ch);ch=getchar()) ret=(ret<<1)+(ret<<3)+ch-48;return f?ret:-ret;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}//逆元
//int head[N],NEXT[M],ver[M],tot;void link(int u,int v){ver[++tot]=v;NEXT[tot]=head[u];head[u]=tot;}


db p[240],dps[240];
db dp[240][140],pw[240][140];
void init(){
    for(int i=0;i<240;i++)
        for(int j=0;j<140;j++) dp[i][j]=0;
}
int main(){
    //freopen("1.txt","r",stdin);
    //ios::sync_with_stdio(false);
    int t;
    int n,k;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&k);
        init();
        for(int i=1;i<=n;i++){
            scanf("%lf%lf",&p[i],&dps[i]);
        }
        for(int i=1;i<=n;i++){
            pw[i][0]=1.0;
            for(int j=1;j<=k;j++){
                pw[i][j]=pw[i][j-1]*(1-p[i]);
            }
        }
        db ans=0.0;
        dp[0][k]=1;
        for(int i=1;i<=n;i++){
            db res=0.0;
            for(int j=0;j<=k;j++){
                dp[i][j]=dp[i-1][j]*pw[i][j]+dp[i-1][j+1]*(1-pw[i][j+1]);
                res+=dp[i-1][j+1]*(1-pw[i][j+1]);
            }
            ans+=res*dps[i];
        }
        printf("%.10f\n",ans);
    }
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}