hdu 2602 01背包，hdu 1114 完全背包

最新推荐文章于 2022-09-09 22:07:37 发布

a1368017681

最新推荐文章于 2022-09-09 22:07:37 发布

阅读量276

点赞数

分类专栏：算法文章标签： 01背包完全背包 hdu

本文链接：https://blog.csdn.net/a1368017681/article/details/50926351

版权

算法专栏收录该内容

4 篇文章 0 订阅

订阅专栏

这两道题是经典的01背包和完全背包

首先是2602 01背包代码如下

#include <cstdio>
#include <cstdlib>
#include <cstring>
#define N 1005
int value[N];
int weight[N];
int dp[N];
int max(int a,int b)
{
    return a>b?a:b;
}
int main()
{
    int cases,i,j;
    scanf("%d",&cases);
    while(cases--){
        int n,v;
        memset(dp,0,sizeof(dp));
        memset(weight,0,sizeof(weight));
        memset(value,0,sizeof(value));
        scanf("%d %d",&n,&v);
        for(i=0;i<n;i++)scanf("%d",&value[i]);
        for(i=0;i<n;i++)scanf("%d",&weight[i]);
        for(i=0;i<n;i++){
            for(j=v;j>=weight[i];j--)
            dp[j]=max(dp[j],dp[j-weight[i]]+value[i]);
        }
        printf("%d\n",dp[v]);
    }
    return 0;
}

然后是完全背包1114 代码如下，注意状态转移方程的区别

#include <cstdio>
#include <cstdlib>
#include <cstring>
#define N 505
#define M 10005
const int inf=1000000;
int value[N];
int weight[N];
int dp[M];
int min(int a,int b)
{
    return a>b?b:a;
}
int main()
{
    int cases,i,j;
    int emptyW,fullW,n;
    scanf("%d",&cases);
    while(cases--){
        memset(dp,inf,sizeof(dp));
        dp[0]=0;
        scanf("%d %d",&emptyW,&fullW);
        int W=fullW-emptyW;
        scanf("%d",&n);
        for(i=0;i<n;i++)scanf("%d %d",&value[i],&weight[i]);
        for(i=0;i<n;i++){
            for(j=weight[i];j<=W;j++)
                dp[j]=min(dp[j],dp[j-weight[i]]+value[i]);
        }
        if(dp[W] < inf)
            printf("The minimum amount of money in the piggy-bank is %d.\n",dp[W]);
        else
            printf("This is impossible.\n");
    }
    return 0;
}