UVA 624 CD （DP）

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=87813#problem/G

CD

Description

You have a long drive by car ahead. You have a tape recorder, but unfortunately your best music is on CDs. You need to have it on tapes so the problem to solve is: you have a tape N minutes long. How to choose tracks from CD to get most out of tape space and have as short unused space as possible.

Assumptions:

• number of tracks on the CD. does not exceed 20
• no track is longer than N minutes
• tracks do not repeat
• length of each track is expressed as an integer number
• N is also integer

Program should find the set of tracks which fills the tape best and print it in the same sequence as the tracks are stored on the CD

Input 

Any number of lines. Each one contains value N, (after space) number of tracks and durations of the tracks. For example from first line in sample data: N=5, number of tracks=3, first track lasts for 1 minute, second one 3 minutes, next one 4 minutes

Output 

Set of tracks (and durations) which are the correct solutions and string `` sum:" and sum of duration times.

Sample Input 

5 3 1 3 410 4 9 8 4 220 4 10 5 7 490 8 10 23 1 2 3 4 5 745 8 4 10 44 43 12 9 8 2

Sample Output 

1 4 sum:58 2 sum:1010 5 4 sum:1910 23 1 2 3 4 5 7 sum:554 10 12 9 8 2 sum:45

要经历N分钟长的时间，如何选择带子可以尽可能的利用时间


每个CD的时间不超过 20
没有哪个CD的时间是超过N的
CD不能重复
每个长度和N都是一个整数


数据：
一个N代表时间， M代表有M个CD


分析：
其实就是0-1背包+打印路径

///#pragma comment (linker, "/STACK:102400000,102400000")#include <iostream>#include <queue>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <cstdlib>#include <limits>#include <stack>#include <vector>#include <map>using namespace std;#define N 1350#define INF 0xfffffff#define PI acos (-1.0)#define EPS 1e-8int dp[N][N], w[N];void path (int m, int n);int main (){    int n, m;    while (~scanf ("%d %d", &n, &m))    {        memset (dp, 0, sizeof (dp));        for (int i=1; i<=m; i++)            scanf ("%d", &w[i]);        for (int i=1; i<=m; i++)        {            for (int j=1; j<=n; j++)            {                if (j < w[i])                    dp[i][j] = dp[i-1][j];                else                    dp[i][j] = max (dp[i-1][j], dp[i-1][j-w[i]] + w[i]);            }        }        path (m, n);        printf ("sum:%d\n", dp[m][n]);    }    return 0;}void path (int m, int n){    if (m == 0) return;    if (dp[m][n] == dp[m-1][n])        path (m-1, n);    else    {        path (m-1, n-w[m]);        printf ("%d ", w[m]);    }}