Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 18593 | Accepted: 8490 |
Description
Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm i in the supplied list has a weight Wi (1 ≤ Wi ≤ 400), a 'desirability' factor Di (1 ≤ Di ≤ 100), and can be used at most once. Bessie can only support a charm bracelet whose weight is no more than M (1 ≤ M ≤ 12,880).
Given that weight limit as a constraint and a list of the charms with their weights and desirability rating, deduce the maximum possible sum of ratings.
Input
* Line 1: Two space-separated integers: N and M
* Lines 2..N+1: Line i+1 describes charm i with two space-separated integers: Wi and Di
Output
* Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints
Sample Input
4 6 1 4 2 6 3 12 2 7
Sample Output
23
代码:
#include<stdio.h>
#include<string.h>
#define Maxn 13000
#define max(a,b) ((a)>(b)?(a):(b))
int w[3500],v[3500];
int f[Maxn];
int sum(int w[],int i,int n)
{
int j,sum=0;
for(j=i+1;j<=n;j++)
sum+=w[j];
return sum;
}
void ZO_Pack(int f[],int w[],int v[],int c,int n) //0—1背包问题
{
int i,j,bound;
memset(f,0,sizeof(int)*(c+1));
for(i=1;i<=n-1;i++){
bound=max(c-sum(w,i,n),w[i]);
for(j=c;j>=bound;j--)
f[j]=max(f[j],f[j-w[i]]+v[i]);
}
f[c]=max(f[c],f[c-w[n]]+v[n]);
}
int main()
{
int i,n,m;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d%d",&w[i],&v[i]);
ZO_Pack(f,w,v,m,n);
printf("%d\n",f[m]);
return 0;
}
注:典型的01背包问题。
01背包动态规划的转移公式:
当考虑第i件物品的时候,背包能装得下的话,
dp(i,j)=max{dp(i-1,j),dp(i-1,j-w[i])+v[i]}
如果背包装不下第i件物品的话
dp(i,j)=dp(i-1,j)
上述程序:进行了内存和常数的优化。