【题解】LuoGu3239：亚瑟王

原题传送门
令$p_i$表示第$i$个技能的概率
$ans=\sum p_i\ast d_i$

令$d{p}_{i,j}$表示前$i$个技能，成功了$j$个的概率
$d{p}_{i,j}=d{p}_{i-1,j}\ast (1-p_i{)}^{r-j}+d{p}_{i-1,j-1}\ast [1-(1-p_i{)}^{r-j+1}]$
$p_i=\sum d{p}_{i-1,j}\ast [1-(1-p_i{)}^{r-j}]$

Code：

#include <bits/stdc++.h>
#define maxn 251
using namespace std;
double p[maxn], dp[maxn][maxn], power[maxn][maxn], d[maxn];
int n, m;

int main(){
	int T; scanf("%d", &T);
	while (T--){
		scanf("%d%d", &n, &m);
		for (int i = 1; i <= n; ++i){
			scanf("%lf%lf", &p[i], &d[i]);
			power[i][0] = 1;
			for (int j = 1; j <= m; ++j) power[i][j] = power[i][j - 1] * (1 - p[i]);
		}
		dp[0][0] = 1;
		for (int i = 1; i <= n; ++i)
			for (int j = 0; j <= i; ++j){
				dp[i][j] = dp[i - 1][j] * power[i][m - j];
				if (j) dp[i][j] += dp[i - 1][j - 1] * (1 - power[i][m - j + 1]);
			}
		double ans = 0;
		for (int i = 1; i <= n; ++i){
			double s = 0;
			for (int j = 0; j <= i - 1; ++j) s += dp[i - 1][j] * (1 - power[i][m - j]);
			ans += s * d[i];
		}
		printf("%.10lf\n", ans);
	}
	return 0;
}