要求恰好装满背包,那么在初始化时除了f[0]为0其它f[1..V]均设为-∞,这样就可以保证最终得到的f[N]是一种恰好装满背包的最优解。
Piggy-Bank
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2755 Accepted Submission(s): 1366
But there is a big problem with piggy-banks. It is not possible to determine how much money is inside. So we might break the pig into pieces only to find out that there is not enough money. Clearly, we want to avoid this unpleasant situation. The only possibility is to weigh the piggy-bank and try to guess how many coins are inside. Assume that we are able to determine the weight of the pig exactly and that we know the weights of all coins of a given currency. Then there is some minimum amount of money in the piggy-bank that we can guarantee. Your task is to find out this worst case and determine the minimum amount of cash inside the piggy-bank. We need your help. No more prematurely broken pigs!
3 10 110 2 1 1 30 50 10 110 2 1 1 50 30 1 6 2 10 3 20 4
The minimum amount of money in the piggy-bank is 60. The minimum amount of money in the piggy-bank is 100. This is impossible.
#include<stdio.h>
#include<string.h>
int min[20000],P[1000],W[1000];
#define INF 1000000000
int MIN(int a,int b)
{
if(a>b)return b;
else
return a;
}
int E,F,N,M;
int main()
{
int T,i,j;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&E,&F);
M=F-E;
scanf("%d",&N);
for(i=0;i<N;i++)
scanf("%d%d",&P[i],&W[i]);
min[0]=0;
for(i=1;i<=M;i++)min[i]=INF;
for(i=0;i<N;i++)
{
for(j=W[i];j<=M;j++)
min[j]=MIN(min[j-W[i]]+P[i],min[j]);
}
if(min[M]<INF)
printf("The minimum amount of money in the piggy-bank is %d.\n",min[M]);
else
printf("This is impossible.\n");
}
return 0;
}