对于此类题目前提是先要记住公式,然后再根据题意随机应变,例如此题应该把先
根据Q-P进行排序。
C - 01背包
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
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 10 10 15 10 5 10 5 3 10 5 10 5 3 5 6 2 7 3
Sample Output
5 11
解答:
#include<stdio.h>
#include<string.h>
int main()
{
int a,b;
int i,j,t;
int c[10001],d[10001],f[10001],g[10001];
while(scanf("%d%d",&a,&b)!=EOF)
{
memset(g,0,sizeof(g));
for(i=0;i<a;i++)
scanf("%d%d%d",&c[i],&d[i],&f[i]);
for(i=0;i<a;i++)
{
for(j=0;j<i;j++)
{
if(d[i]-c[i]<d[j]-c[j])
{
t=c[i];c[i]=c[j];c[j]=t;
t=d[i];d[i]=d[j];d[j]=t;
t=f[i];f[i]=f[j];f[j]=t;
}
}
}
for(i=0;i<a;i++)
{
for(j=b;j>=d[i];j--)
{
if(g[j]<g[j-c[i]]+f[i])
g[j]=g[j-c[i]]+f[i];
}
}
printf("%d\n",g[b]);
}
}