POJ_2184 Cow Exhibition (0-1背包)
2012-01-01 21:51
225 查看
/*题意很清楚。思路大概是:设dp[i]表示sum(s[x]) = i 时dp[i] = sum(f[x])取到最大。所 得的i + dp[i]就是结果。因为s[i]有负的。所以0坐标位置移动一下。dp[i]初始化为 -∞。0坐 标位置为dp[MID] = 0;*/ //主要代码: for(i = 0; i < n; i++) { if(s[i] <= 0 && f[i] <= 0) continue; if(s[i] > 0) { for(j = M; j >= s[i]; j--) { if(dp[j-s[i]] != -inf) dp[j] = max(dp[j-s[i]] + f[i], dp[j]); } } else { for(j = 0; j <= M + s[i]; j++) { if(dp[j-s[i]] != -inf) dp[j] = max(dp[j-s[i]] + f[i], dp[j]); } } }
相关文章推荐
- POJ - 2184 Cow Exhibition(变种01背包...)
- poj 2184 Cow Exhibition 负值01背包
- POJ 2184 Cow Exhibition (01背包变形)(或者搜索)
- POJ 2184 Cow Exhibition [dp 背包]
- POJ 2184 Cow Exhibition (体积为负时01背包的处理+问题转化)
- POJ-2184-01背包变形-Cow Exhibition
- POJ 2184 Cow Exhibition ( 01背包变形 )
- POJ 2184 Cow Exhibition 01 背包变形
- POJ 2184 Cow Exhibition (01背包的变形)
- POJ 2184 Cow Exhibition (01背包变形 + 技巧 好题)
- POJ 2184 Cow Exhibition 0-1背包
- poj 2184 Cow Exhibition 背包
- POJ 2184 Cow Exhibition(DP:01背包)
- [POJ 2184]--Cow Exhibition(0-1背包变形)
- poj 2184 Cow Exhibition 01背包变形
- POJ 2184 Cow Exhibition(0-1背包,负化正)
- poj 2184 Cow Exhibition(dp之01背包变形)
- POJ 2184 Cow Exhibition 奶牛展(01背包,变形)
- POJ 2184 Cow Exhibition(01背包变形)
- poj(2184)——Cow Exhibition(01背包变形)