HDU3466 Proud Merchants

题目描述：

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?

输入描述：

There are several test cases in the input.

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.

输出描述：

For each test case, output one integer, indicating maximum value iSea could get.

题意：

有n个商人，每个商人都很自负，如果你的钱数少于Qi，那么就不与你交易

思路：

这题交易的顺序会影响答案，比如

5 10 5

3 5 6

如果先去第一个再去第二个可以获得11

但是先去第二个再去第一个就只能获得6

先买i后买j

M >= Qi, M - Pi >= Qj

买j后不能买i

M >= Qj, M - Pj < Qi

推导：

Pi - M <= -Qj

M - Pj < Qi

Pi - Pj < Qi - Qj

Pi - Qi < Pj - Qj

Qi - Pi > Qj - Pj

如果满足Qi - Pi > Qj - Pj那么就说明i 不能先j

排序后背包即可

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
ll dp[5005];
struct node{int p, q, v;
}arr[505];
bool cmp(node a, node b){return a.q - a.p < b.q - b.p;
}
int main(){int n, m;while(cin >> n >> m){for(int i = 1; i <= n; i++){cin >> arr[i].p >> arr[i].q >> arr[i].v;}sort(arr + 1, arr + 1 + n, cmp);for(int j = 0; j <= m; j++){dp[j] = 0;}for(int i = 1; i <= n; i++){for(int j = m; j >= arr[i].q; j--){dp[j] = max(dp[j], dp[j - arr[i].p] + arr[i].v);}}cout << dp[m] << endl;}return 0;
}

HDU3466 Proud Merchants相关推荐

【HDU - 3466 】Proud Merchants（dp，背包问题，巧妙排序）
题干: Recently, iSea went to an ancient country. For such a long time, it was the most wealthy and pow ...
01背包入门：HDU 3466 Proud Merchants
这道题对我来说还是有点难度的,所以参考了两个博主的博客:博主1博主2 Problem Description Recently, iSea went to an ancient country. Fo ...
【HDU 3466】【Proud Merchants】
题目: Recently, iSea went to an ancient country. For such a long time, it was the most wealthy and pow ...
Proud Merchants
题目链接: https://vjudge.net/contest/348156#problem/I 题面: 翻译: 最近,伊萨去了一个古老的国家.在这么长的时间里,它是世界上最富有和最强大的王国.因此 ...
这段时间做的简单dp题目（部分）
这些时间vj上做的部分题目 HDU5115 题意:第一行t,t组测试数据,每组数据第一行输入n表示n匹狼,第二行给出一个序列表示每匹狼的伤害,第三行给出每匹狼能给周围狼的伤害增幅,求怎样打可以得到最小 ...
暑假N天乐 —— 01背包及变形
暑假集训的第一天第二天了. 决定还是先把基础巩固一下好了,万一后面训练赛出事故更尴尬. 所以今天的主题是 -- 01背包及变形动态规划概念动态规划(Dynamic programming,DP) ...
提高组精英班Day4
动态规划动态规划 (dynamic programming, DP) 是求解决策过程最优化的数学方法. 动态规划是通过拆分问题,定义问题状态和状态之间的关系,使得问题能够以递推的方式去解决. 如何拆 ...
android jar 无法访问r文件,android项目中gen目录不能自动生成R.java的原因
php分页代码简单实现版权声明:本文为博主原创文章,未经博主允许不得转载. 数据库操作类代码:mysqli.func.php <?php // 数据库连接常量 define('DB_HOST' ...
2013-2014集训第二次个人积分赛
地址:http://acm.hdu.edu.cn/webcontest/contest_show.php?cid=6346 密码acmore 这次比赛实在有点寒酸,11题我就弄出个最简单的题(还是找规 ...

HDU3466 Proud Merchants

HDU3466 Proud Merchants相关推荐

最新文章

热门文章