272人阅读 评论(0)

# Problem X

##### Total Submission(s) : 73   Accepted Submission(s) : 37
Problem Description
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.<br>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.<br>If he had M units of money, what’s the maximum value iSea could get?<br><br>

Input
There are several test cases in the input.<br><br>Each test case begin with two integers N, M (1 ≤ N ≤ 500, 1 ≤ M ≤ 5000), indicating the items’ number and the initial money.<br>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.<br><br>The input terminates by end of file marker.<br><br>

Output
For each test case, output one integer, indicating maximum value iSea could get.<br><br>

Sample Input
2 10
10 15 10
5 10 5
3 10
5 10 5
3 5 6
2 7 3


Sample Output
5
11


最近,设想了一个古老的国家。这么长时间,这是世界上最富有和最强大的王国。结果,人们在这个国家仍然是非常自豪,即使他们的国家没有那么富裕了。< br >商人是最典型的,他们每个人只卖出了一个项目,价格是π,但他们会拒绝和你做交易如果你的钱少于七,六世和iSea评估每一项价值。< br >如果他台的钱,iSea最大值可以得到什么?

用一个结构数组会是题简单一点，最重要的是要将p-q排序，再加上状态方程就ok了。。。。dp[j] = max(dp[j],dp[j-a[i].p]+a[i].v);

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

struct node
{
int p,q,v;
} a[555];

int cmp(node x,node y)
{
return x.q-x.p<y.q-y.p;
}

int main()
{
int n,m,i,j;
int dp[5555];
while(~scanf("%d%d",&n,&m))
{
for(i = 0; i<n; i++)
scanf("%d%d%d",&a[i].p,&a[i].q,&a[i].v);
memset(dp,0,sizeof(dp));
sort(a,a+n,cmp);
for(i = 0; i<n; i++)
{
for(j = m; j>=a[i].q; j--)
{
dp[j] = max(dp[j],dp[j-a[i].p]+a[i].v);
}
}
printf("%d\n",dp[m]);
}

return 0;
}


0
0

个人资料
• 访问：127986次
• 积分：2272
• 等级：
• 排名：第19489名
• 原创：98篇
• 转载：19篇
• 译文：0篇
• 评论：73条
最新评论