01背包+输出所选背包

来源：互联网发布：云计算市场规模编辑：程序博客网时间：2024/06/05 20:16

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn=100;
int dp[maxn][maxn];
int value[maxn];
int weight[maxn];
int x[maxn];
int main(){
    int n,c;
    freopen("f.txt","r",stdin);
    while(~scanf("%d%d",&n,&c)){
       memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++){
            scanf("%d",&value[i]);
        }
        for(int i=1;i<=n;i++){
            scanf("%d",&weight[i]);
        }
        int i,j;
        for(i=1;i<=n;i++){
            for(j=weight[i];j<=c;j++){
                dp[i][j]=max(dp[i-1][j],dp[i-1][j-weight[i]]+value[i]);
            }
        }

        printf("Optimal value is\n%d\n",dp[n][c]);
        j=c;
        for(i=n;i>=0;i--){
            if(dp[i][j]>dp[i-1][j]){
                x[i]=1;
                j-=weight[i];
            }else{
            x[i]=0;
            }
        }
        for(i=1;i<=n;i++){
            if(i==1) printf("%d",x[i]);
            else printf(" %d",x[i]);
        }
    }

}

0 0