Uva 642-CD（0-1背包+打印路径）

来源：互联网发布：node.js php 接口开发编辑：程序博客网时间：2024/05/17 03:01

题目链接:点击打开链接

裸01背包，此题中价值即体积... 打印路径。。不多说了一维的没看懂。。上个二维的

#include <algorithm>#include <iostream>#include <cstring>#include <cstdlib>#include <string>#include <cctype>#include <vector>#include <cstdio>#include <cmath>#include <queue>#include <stack>#include <map>#include <set>#define maxn 10100#define _ll __int64#define ll long long#define INF 0x3f3f3f3f#define Mod 1000000007#define pp pair<int,int>#define ull unsigned long longusing namespace std;int N,n,w[25],dp[25][maxn],ans[25];void input(){memset(dp,0,sizeof(dp));for(int i=1;i<=n;i++){scanf("%d",&w[i]);for(int j=0;j<=N;j++){dp[i][j]=(i==1?0:dp[i-1][j]);    if(j>=w[i])dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+w[i]);}}}void output(){int p=0,c=dp[n][N];for(int i=n;i>=1;i--){if(dp[i][c]!=dp[i-1][c]){ans[p++]=i;c-=w[i];}}for(int i=p-1;i>=0;i--)printf("%d ",w[ans[i]]);printf("sum:%d\n",dp[n][N]);}int main(){while(scanf("%d %d",&N,&n)!=EOF){input();output();}    return 0;}

1 0