Poj 2184 Cow Exhibition
2014-11-07 22:49
211 查看
变形的01背包,其实问题的本质是保证智商和幽默感和不为负数情况下的最大和。智商属性体积,幽默感属性为价值,问题转换为 求体积大等于0时的体积、价值总和。
/*********************** * Author:fisty * Data:2014-11-7 * poj2184 * 01变形 * *******************/ #include <cstdio> #include <cstring> #include <algorithm> using namespace std; #define MAX_N 201000 int dp[MAX_N]; int s[MAX_N], f[MAX_N]; int main(){ int n; scanf("%d", &n); for(int i = 0;i < n; i++){ scanf("%d%d", &s[i], &f[i]); } for(int i = 0;i <= 200000; i++) dp[i] = -0x3f3f3f; dp[100000] = 0; for(int i = 0;i < n; i++){ if(s[i] > 0){ for(int j = 200000;j >= s[i]; j--){ dp[j] = max(dp[j], dp[j-s[i]] + f[i]); } }else{ for(int j = 0;j <= 200000+s[i]; j++){ dp[j] = max(dp[j], dp[j-s[i]] + f[i]); } } } int ans = 0; for(int i = 100000;i <= 200000; i++){ if(dp[i] >= 0 && dp[i]+i-100000 > ans){ ans = dp[i]+i-100000; } } printf("%d\n", ans); return 0; }
相关文章推荐
- poj 2184 Cow Exhibition 负值01背包
- POJ 2184 ->Cow Exhibition - -
- POJ 2184 Cow Exhibition (01背包)
- POJ 2184 Cow Exhibition(DP:01背包)
- POJ-2184-Cow Exhibition
- poj 2184 Cow Exhibition
- poj 2184 Cow Exhibition(背包变形)
- [POJ 2184]Cow Exhibition[DP][01背包]
- POJ 2184 Cow Exhibition
- poj2184 Cow Exhibition
- poj 2184--Cow Exhibition
- POJ 2184 - Cow Exhibition
- POJ 2184 Cow Exhibition [动态规划 01背包]
- POJ 2184 Cow Exhibition (01背包变形 + 技巧 好题)
- POJ 2184 Cow Exhibition (01背包)
- poj 2184 Cow Exhibition(dp之01背包变形)
- POJ 2184 Cow Exhibition
- POJ 2184 Cow Exhibition (体积为负时01背包的处理+问题转化)
- POJ 2184 Cow Exhibition 0-1背包
- POJ 2184 Cow Exhibition (dp)