UVa - 624 - CD（0-1 + 记录路径)

#include<iostream>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<string>
#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#define N 10001
using namespace std;
const int inf = 1e9;
const int mod = 1<<30;
const double eps = 1e-8;
const double pi = acos(-1.0);
typedef long long LL;

int a
, dp
, vis
[30];

int main()
{
int v, n, i, j;

while(~scanf("%d%d", &v, &n))
{
for(i = 1; i <= n; i++) scanf("%d", &a[i]);
memset(dp, 0, sizeof(dp));
memset(vis, 0, sizeof(vis));

for(i = 1; i <= n; i++)
{
for(j = v; 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;
}
}
}
for(i = n, j = v; i >= 1; i--)
{
if(vis[j][i])
{
printf("%d ", a[i]); j -= a[i];
}
}
printf("sum:%d\n", dp[v]);
}
return 0;
}