uva-2 CD

01背包输出路径

二维数组

#include<bits/stdc++.h>


#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cstdlib>

using namespace std;

int dp[33][11111];
int a[11111];

void path(int id,int w)
{
    if(id==0)
        return;
    if(dp[id][w] == dp[id-1][w])
        path(id-1,w);
    else
    {
        path(id-1,w-a[id]);
        printf("%d ",a[id]);
    }
}
int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        int i,j;
        memset(dp,0,sizeof(dp));
        for(i=1; i<=m; i++)
        {
            scanf("%d",&a[i]);
        }
        for(i=1; i<=m; i++)
        {
            for(j=0; j<=n; j++)
            {
                if(j<a[i])
                    dp[i][j] = dp[i-1][j];
                else
                    dp[i][j] = max(dp[i-1][j],dp[i-1][j-a[i]]+a[i]);
            }
        }
        path(m,n);
        printf("sum:%d\n",dp[m][n]);
    }
    return 0;
}

一位数组

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cstdlib>

using namespace std;

int dp[11111];
int a[11111];
int vis[11111][33];

int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        int i,j;
        for(i=1; i<=m; i++)
        {
            scanf("%d",&a[i]);
        }
        memset(dp,0,sizeof(dp));
        memset(vis,0,sizeof(vis));
        for(i=1; i<=m; i++)
        {
            for(j=n; j>=a[i]; j--)
            {
                if(dp[j]<dp[j-a[i]]+a[i])
                {
                    dp[j] = dp[j-a[i]]+a[i];
                    vis[j][i] = 1;
                }
            }
        }
        j = n;
        for(i=m; i>=1; i--)
        {
            if(vis[j][i])
            {
                printf("%d ",a[i]);
                j -=a[i];
            }
        }
        printf("sum:%d\n",dp[n]);
    }
    return 0;
}