poj 2184 Cow Exhibition
2013-05-16 19:35
211 查看
题意:变形的01背包,其实问题的本质是保证智商和幽默感和不为负数情况下的最大和。智商属性体积,幽默感属性为价值,问题转换为
求体积大等于0时的体积、价值总和。
链接:点击打开链接
求体积大等于0时的体积、价值总和。
链接:点击打开链接
#include<iostream> #include<cstdio> #include<algorithm> using namespace std; #define M 10000 #define INF 1000000 #define MAX 200100 int dp[MAX]; int cost[110],val[110]; int main(){ int i,j,n,sum; for(i=0;i<MAX;i++) dp[i]=-INF; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d %d",&cost[i],&val[i]); dp[M]=0; for(i=0;i<n;i++){ if(cost[i]>0){ for(j=MAX;j>=cost[i];j--){ dp[j]=max(dp[j],dp[j-cost[i]]+val[i]); } } else{ for(j=0;j<MAX+cost[i];j++){ dp[j]=max(dp[j],dp[j-cost[i]]+val[i]); } } } sum=0; for(i=M;i<MAX;i++) if(dp[i]>0) sum=max(sum,(i-M+dp[i])); printf("%d\n",sum); }
相关文章推荐
- POJ 2184 Cow Exhibition 01背包
- Poj 2184 Cow Exhibition【01背包 变形】
- POJ 2184 Cow Exhibition (体积为负时01背包的处理+问题转化)
- poj 2184 Cow Exhibition
- POJ 2184 Cow Exhibition (01背包变形)(或者搜索)
- poj-2184-Cow Exhibition
- 01背包问题-POJ 2184 Cow Exhibition
- poj 2184 - Cow Exhibition (01背包) 解题报告
- POJ 2184 Cow Exhibition
- POJ--2184--Cow Exhibition--01背包
- POJ 2184 Cow Exhibition (想法题&双变量0-1背包)
- poj 2184 Cow Exhibition
- POJ - 2184 Cow Exhibition(变种01背包...)
- POJ 2184 Cow Exhibition
- POJ 2184 Cow Exhibition 01背包的变形
- poj 2184 Cow Exhibition
- POJ 2184 Cow Exhibition (带负值的01背包)
- poj 2184 Cow Exhibition (变形的01背包)
- POJ 2184 Cow Exhibition
- poj 2184 Cow Exhibition (01背包)