hdu1114（完全背包变形）

题目连接Piggy-Bank

给定所有硬币的重量和价值，求一个给定重量的存钱罐，至少装了多少钱

每种硬币的数量是无限的->完全背包变形

dp[v]=min（dp[v]，dp[v-weight]+value）;

初始化技巧

memset(dp,0x3f3f3f3f,sizeof(dp));

代码

#include <iostream>
#include <stdio.h>
#include <memory.h>
#include <algorithm>
using namespace std;

const int INF=0x3f3f3f3f;
const int maxv=10005;
const int maxn=505;
int V;
struct node
{
    int v,w;
}coin[maxn];

int dp[maxv];

void CompletePack(int C,int W)
{
    for(int v=C;v<=V;v++){
        dp[v]=min(dp[v],dp[v-C]+W);
    }
}

int main()
{
    //freopen("in.txt","r",stdin);
    int T,E,F,n;
    scanf("%d",&T);
    while(T--){
        memset(dp,0x3f3f3f3f,sizeof(dp));
        scanf("%d%d",&E,&F);V=F-E;
        scanf("%d",&n);
        dp[0]=0;
        for(int i=0;i<n;i++)scanf("%d%d",&coin[i].v,&coin[i].w);
        for(int i=0;i<n;i++)CompletePack(coin[i].w,coin[i].v);
        if(dp[V]!=INF)printf("The minimum amount of money in the piggy-bank is %d.\n",dp[V]);
        else printf("This is impossible.\n");
    }
    return 0;
}