Recently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a result, the people in this country are still very proud even if their nation hasn’t been so wealthy any more.
The merchants were the most typical, each of them only sold exactly one item, the price was Pi, but they would refuse to make a trade with you if your money were less than Qi, and iSea evaluated every item a value Vi.
If he had M units of money, what’s the maximum value iSea could get?
The merchants were the most typical, each of them only sold exactly one item, the price was Pi, but they would refuse to make a trade with you if your money were less than Qi, and iSea evaluated every item a value Vi.
If he had M units of money, what’s the maximum value iSea could get?
Each test case begin with two integers N, M (1 ≤ N ≤ 500, 1 ≤ M ≤ 5000), indicating the items’ number and the initial money.
Then N lines follow, each line contains three numbers Pi, Qi and Vi (1 ≤ Pi ≤ Qi ≤ 100, 1 ≤ Vi ≤ 1000), their meaning is in the description.
The input terminates by end of file marker.
2 10 10 15 10 5 10 5 3 10 5 10 5 3 5 6 2 7 3
511
题意:
给你一部分钱,求你能购买的你认为的价值最高的东西。三个变量,qi,pi,vi,qi代表商品价格,pi代表你的钱不能小于qi,否则你不能买这个商品,即使你的钱大于商品价格。当然,钱小于商品价格肯定买不了。vi代表你认为这个东西的价值是多少。
题解:
这是一般的01背包问题的变形,和一般的01背包问题不同的是此题多了一个变量pi.而因为这个pi会导致相同的钱可以买到不同的东西。假如有两种商品,数据如下:
2 10
5 10 53 5 6假如我们先购买第一种,我们有十块钱,可以买第一种,买了还剩下五块钱,还可以再买第二件。得到的商品价值为11.假如我们先买第二件,剩余五块钱,这时候你想买第一件就不行了,即使你的钱等于商品价格,但人家不卖给你。所以最后得到的价值为6。所以我们需要判断应该先买哪一件,这时候就需要贪心思想去排序了。关于如何排序,我们再看这两组数据,这两组数据满足p1+q2><p2+q1 得 q1-p1>q2-p2,所以可用sort排序,将数据按照q-p=的差值从大到小排序。
到这里还没结束,因为m的最大值为5000,所以用普通的二维数组易内存超限。
for(i=0;i<n;i++) for(j=0;j<=m;j++) { if(j<Q[i].q) dp[i+1][j]=dp[i][j]; else dp[i+1][j]=max(dp[i][j],dp[i][j-Q[i].p]+Q[i].v); }
而且最重要的是,因为dp是从后向前尝试放入物品,所以sort排序是从小到大排序。
代码如下:#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int dp[5100]; struct node { int p,q,v; int cha; } Q[110000]; int cmp(node a,node b) { return a.cha<b.cha; } int main() { int n,m,i,j; while(~scanf("%d%d",&n,&m)) { memset(dp,0,sizeof(dp)); for(i=0; i<n; i++) { scanf("%d%d%d",&Q[i].p,&Q[i].q,&Q[i].v); Q[i].cha=Q[i].q-Q[i].p; } sort(Q,Q+n,cmp); for(i=0;i<n;i++) { for(j=m;j>=Q[i].q;j--) { dp[j]=max(dp[j],dp[j-Q[i].p]+Q[i].v); } } printf("%d\n",dp[m]); } }