LightOJ-1274 Beating the Dataset

期望dp+逆推

参考题解：https://blog.csdn.net/qq_31759205/article/details/54646913

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
const int N=5000+10;
double d[N][2];
int main()
{
	int T,n,s,kase=0;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d",&n,&s);
		for(int i=0;i<=n;i++)
			d[i][0]=d[i][1]=0.0;
		int numy=s-n*2;
		int numn=n-numy;
		for(int i=n-1;i>=0;i--)
		{
			int ma=min(numy,i);
			int mi=max(0,i-numn);
			for(int j=mi;j<=ma;j++)
			{
				double ry=(double)(numy-j)/(n-i);
				double rn=(double)(numn-(i-j))/(n-i);
				d[j][1]=(d[j][0]+1)*rn+d[j+1][1]*ry;
				d[j][0]=(d[j+1][1]+1)*ry+d[j][0]*rn;
			}
		}
		printf("Case %d: %.6f\n",++kase,d[0][1]);
	}
	return 0;
}