UVA 624

01背包+记忆话路径

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
const int inf=0x3f3f3f3f;
const int maxn=25;
int dp[10005];
int vis[maxn][10005];
int v[maxn];
int main()
{
    int V,n;
    while(~scanf("%d%d",&V,&n))
    {
        memset(dp,0,sizeof(dp));
        memset(vis,0,sizeof(vis));
        memset(v,0,sizeof(v));
        for(int i=0;i<n;i++)
            scanf("%d",&v[i]);
        for(int i=0;i<n;i++)
        {
            for(int j=V;j>=v[i];j--)
            {
                if(dp[j]<=dp[j-v[i]]+v[i])
                {
                    dp[j]=dp[j-v[i]]+v[i];
                    vis[i][j]=1;
                }
            }
        }
        for(int i=n-1,j=V;i>=0;i--)
        {
            if(vis[i][j])
            {
                printf("%d ",v[i]);
                j-=v[i];
            }
        }
        printf("sum:%d\n",dp[V]);
    }
    return 0;
}