【BZOJ 4008 [HNOI2015]亚瑟王】

BZOJ4008
中文题意 大佬们耐心看下
做法 第一次看这种dp真的无从下手 于是翻开了题解
先把期望转换成求概率
原来这种轮次的dp 有一维状态还可以是轮次
$dp[i][j]$代表$i$这张牌在第$j$轮的概率
那么很显然
你这$j$轮取的话 $i-1$肯定是从$j+1$轮过来(否则你不能到$j$轮)
那么概率就是 $$dp\left[i-1\right]\left[j+1\right]\ast \left(1-{\left(1-p\left[i\right]\right)}^{j+1}\right)$$
然后你这轮不取 那么就是$i-1$也从$j$轮过来
概率就是
$$dp\left[i-1\right]\left[j\right]\ast {\left(1-p\left[i\right]\right)}^j$$
然后我们统计每一个物品这$m$轮把他们取了的概率都加起来 然后乘上伤害 就是我们的期望了

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

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);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
double dp[300][300],tmp[300][300],p[300];
int d[300];
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int t;scanf("%d",&t);
    while(t--)
    {
        int n,m;
        scanf("%d%d",&n,&m);
        for(int i = 1;i<=n;++i)
        {
            scanf("%lf%d",&p[i],&d[i]);
            p[i] = 1.0-p[i];
            tmp[i][0] = 1.0;
            for(int j = 1;j<=m;++j)
                tmp[i][j] = tmp[i][j-1]*p[i];
        }
        for(int i = 0;i<300;++i)
            for(int j = 0;j<300;++j) dp[i][j] = 0.0;//注意一定要比m大 因为你从m+1和m开始
        double ans = 0.0;
        dp[0][m] = 1.0;
        for(int i = 1;i<=n;++i)
        {
            double res = 0.0;
            for(int j =m;j>=0;--j)
            {
                dp[i][j] = dp[i-1][j]*tmp[i][j]+dp[i-1][j+1]*(1.0-tmp[i][j+1]);
                res+=dp[i-1][j+1]*(1-tmp[i][j+1]);
            }
            ans += res*1.0*d[i];
        }
        printf("%.10f\n",ans);
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}