HDU 3466 Proud Merchants【01dp】
来源:互联网 发布:跟兄弟连学php 当当网 编辑:程序博客网 时间:2024/05/22 05:07
Proud Merchants
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 5497 Accepted Submission(s): 2318
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.
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?
Input
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.
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.
Output
For each test case, output one integer, indicating maximum value iSea could get.
Sample Input
2 1010 15 105 10 53 105 10 53 5 62 7 3
Sample Output
511
Author
iSea @ WHU
#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<climits>#include<string>#include<queue>#include<stack>#include<set>#include<map>#include<algorithm>using namespace std;#define rep(i,j,k)for(i=j;i<k;i++)#define per(i,j,k)for(i=j;i>k;i--)#define MS(x,y)memset(x,y,sizeof(x))typedef long long LL;const int INF=0x7ffffff;const int M=550;int dp[5005];int i,j,k,n,m;struct Node{ int p,q,v;}node[M];bool cmp(Node a,Node b){ return a.q-a.p<b.q-b.p;}int main(){ while(~scanf("%d%d",&n,&m)) { rep(i,0,n) scanf("%d%d%d",&node[i].p,&node[i].q,&node[i].v); sort(node,node+n,cmp); MS(dp,0); rep(i,0,n) 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;}
0 0
- HDU 3466 Proud Merchants【01dp】
- HDU 3466 Proud Merchants(DP:01背包+贪心)
- hdu 3466 Proud Merchants(DP)
- hdu 3466 Proud Merchants(DP)
- hdu 3466 Proud Merchants (排序的dp)
- hdu 3466 Proud Merchants(贪心+DP)
- HDU 3466 Proud Merchants 贪心+dp
- hdu 3466 Proud Merchants
- HDU 3466 Proud Merchants
- hdu 3466 Proud Merchants
- hdu 3466 Proud Merchants
- hdu 3466 Proud Merchants
- HDU-3466-Proud Merchants
- HDU 3466 Proud Merchants
- hdu 3466 Proud Merchants
- HDU 3466 Proud Merchants
- HDU 3466 Proud Merchants
- hdu 3466 Proud Merchants
- Android开发ListView 和Linearlayout的分割线
- 字符串函数strcat, strcpy, strcmp, strlen实现模型
- 119. Pascal's Triangle II*
- Python 学习笔记
- java 基础之网络编程
- HDU 3466 Proud Merchants【01dp】
- NS3系列—4———NS3中文教程5:Tweaking NS3
- #Day2 C++
- Leetcode: Median of Two Sorted Arrays
- case when用法
- CSS3的REM设置字体大小
- 教你如何关掉NEXUS5手机OTA升级提醒
- 嵌入式 - 虚拟机、开发板与主机Ping不通问题解决方法
- RabbitMQ概念及环境搭建 -- RabbitMQ cluster