练习三 Problem X

原创 2016年05月31日 20:04:39
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

题意:首先给出物品数量和手中资金之后每样物品给出价格,需要购买时手中至少需要的资金,以及物品本身的价值,求最大资金是多少。

思路:01背包,先按q-p排保证差额最小(最优),dp方程:dp[j]=max(dp[j],dp[j-node[i].p]+node[i].v);

感想:算是参考了网上的答案吧,不高兴 = =

代码:
<span style="font-size:14px;color:#6600cc;background-color: rgb(255, 255, 255);">#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int MAXN=550;
struct Node
{
    int p,q,v;
}node[MAXN];
int dp[5500];
bool cmp(Node a,Node b)
{
    return a.q-a.p<b.q-b.p;
}
int main()
{
    int n,m,i,j;
    while(cin>>n>>m)
    {
        for(int i=0;i<n;i++)
          scanf("%d%d%d",&node[i].p,&node[i].q,&node[i].v);
        sort(node,node+n,cmp);
        memset(dp,0,sizeof(dp));
        for(i=0;i<n;i++)
          for(j=m;j>=node[i].q;j--)
            dp[j]=max(dp[j],dp[j-node[i].p]+node[i].v);
        printf("%d\n",dp[m]);
    }
    return 0;
}</span>



版权声明:本文为博主原创文章,未经博主允许不得转载。

课程练习三-1003-problem C

Problem Description Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is v...

课程练习三-1009-problem I

Problem Description Queues and Priority Queues are data structures which are known to most computer...

课程练习三-1004-problem D

Problem Description A number whose only prime factors are 2,3,5 or 7 is called a humble number. T...

课程练习三-1007-problem G

Problem Description 都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身...

课程练习三-1008-problem H

Problem Description 穿过幽谷意味着离大魔王lemon已经无限接近了!可谁能想到,yifenfei在斩杀了一些虾兵蟹将后,却再次面临命运大迷宫的考验,这是魔王lemon设下的又...

X-Y PROBLEM (酷壳 - 陈皓)

X-Y Problem 对于X-Y Problem的意思如下: 1)有人想解决问题X 2)他觉得Y可能是解决X问题的方法 3)但是他不知道Y应该怎么做 4)于是他去问别人Y应该怎么做...
  • dpsying
  • dpsying
  • 2017年12月12日 16:17
  • 41

ACM程序设计题目 Problem X-24

//大体意思就是输入n个字符串,查找一个字符串是否是另一个字符串的前缀。 //建立一个动态数组,输入后并对其排序,依次对各个字符串到下一个字符串中去寻找,找一个中间量g,找到则g=T,没有则F。 ...

execjs error when upgrade rails from 3.0.x to 3.1.0 [problem solved]

When I upgrade the rails from 3.0.x to 3.1.0, the old app can't work. Even the new one will give the...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:练习三 Problem X
举报原因:
原因补充:

(最多只允许输入30个字)