HDU 2955 Robberies……(01背包 + dp存储成功概率(转化),下标存储抢到多少钱,输出下标)
2018-02-02 19:43
716 查看
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int main() { int t, n, i, j, temp, v[105]; double c, dp[10005], w[105]; scanf("%d", &t); while(t--) { int sum=0; scanf("%lf%d", &c, &n); c=1-c; for(i=0;i<n;i++) { scanf("%d%lf", &v[i], &w[i]); w[i]=1-w[i]; sum+=v[i]; } memset(dp, 0, sizeof(dp)); dp[0]=1; for(i=0;i<n;i++) for(j=sum;j>=v[i];j--) dp[j]=max(dp[j], dp[j-v[i]]*w[i]); for(i=sum;i>=0;i--) if(dp[i]>=c) break; printf("%d\n", i); } return 0; }
相关文章推荐
- HDU 2955 Robberies(01背包的概率问题)
- hdu——2955(dp之01背包,但需要转化下思维)
- HDU 2955 Robberies(DP:01背包)
- HDU 2955 Robberies(经典01背包概率问题)
- hdu 2955 Robberies + LightOJ 1079 Just another Robbery (01背包 概率)
- hdu 2955 Robberies(概率01背包,反向思维)
- hdu 2955 ( Robberies ) 变相01 背包 DP
- hdu 2955 Robberies 0-1背包/概率初始化
- hdu 2955 Robberies 01背包变形
- hdu 2955 Robberies(01背包变形)
- hdu 2955 Robberies--01背包
- HDOJ2955 Robberies(01背包,概率)
- HDU 2955 - Robberies(01 背包)
- HDU - 2955 Robberies 01背包
- hdu 2955 Robberies (DP:背包)
- HDU 2955-Robberies(01背包变形)
- HDU 2955 Robberies(01背包变型)
- HDU 2955 Robberies (01背包,思路要转换一下,推荐!)
- HDU 2955 Robberies(01背包变形)
- HDU 2955 Robberies(01背包变形)