题意:初始一个空串,有Pa/Pa+Pb的概率在后加a,有Pb/Pa+Pb的概率在后加b,问最后的期望的ab子串个数(ab可以不连续)
我是个概率dp弱智,该题证明出自这位句句
所以我补的解法就是他的解法了
希望有朝一日我也能这么强啊
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <cmath>
#define LL long long
#define INF 0x3f3f3f3f
#define mod 1000000007
const int maxn = 1e5 + 5;
using namespace std;
LL dp[1005][1005];
LL k,pa,pb;
LL powmod(LL a, LL n){
LL ans = 1;
while(n){
if(n&1)
ans = (ans*a)%mod;
n/=2;
a=(a*a)%mod;
}
return ans;
}
LL inv(LL x){//逆元
return powmod(x,mod-2);
}
LL DP(int i, int j){
if(i + j >= k)
return (i+j+pa*inv(pb)%mod)%mod;
if(dp[i][j] != -1)
return dp[i][j];
return dp[i][j] = ((pa*DP(i+1,j)%mod + pb*DP(i,i+j)%mod) * inv(pa+pb))%mod;
}
int main(){
cin >> k >> pa >> pb;
memset(dp, -1, sizeof(dp));
cout << DP(1,0) << endl;
return 0;
}