CD UVA - 624（背包问题）

最新推荐文章于 2022-02-06 18:05:57 发布

原创最新推荐文章于 2022-02-06 18:05:57 发布 · 286 阅读

0 ·

CC 4.0 BY-SA版权

背包专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一种解决如何从CD中选择曲目以最优化利用磁带空间的问题。通过使用二维数组标记已选择的曲目及其占用的时间，算法能够在保持曲目原始顺序的同时，最大化磁带的使用效率并减少未使用的空间。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 M and durations of the tracks. For example from first line in sample data: N=5, M=3, first track lasts for 1 minute, second one 3 minutes, next one 4 minutes

The input data satisfies the following constraints:

N≤10000
M≤20

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 4
10 4 9 8 4 2
20 4 10 5 7 4
90 8 10 23 1 2 3 4 5 7
45 8 4 10 44 43 12 9 8 2
Sample Output
1 4 sum:5
8 2 sum:10
10 5 4 sum:19
10 23 1 2 3 4 5 7 sum:55
4 10 12 9 8 2 sum:45

思路：

乍一看以为是简单的01背包，然后又一看还要在输出的时候按原轨道顺序输出；
这可难倒我了，想了好长时间，才搞定，用一个二维数组来标记，当选择了这个轨道时，就标记这个轨道和到这个轨道为止所能储存的最大的时间；

关键在于标记，只有选这个轨道时才能进行标记；具体看代码

#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include <cstring>
#include <vector>
#include <set>
#include <stack>

using namespace std;
typedef long long ll;
const int maxx=1e4+7;
int v[25];
int m,n;
int vist[25][maxx];
int dp[maxx];
int main ()
{
    while(cin >>m>>n)
    {
        memset(dp,0,sizeof dp);
        memset(vist,0,sizeof vist);
        for(int i=n-1;i>=0;i--) cin >>v[i];
        for(int i=0;i<n;i++)
        {
            for(int j=m;j>=v[i];j--)
            {
                if(dp[j]<=dp[j-v[i]]+v[i])
                {
                    dp[j]=dp[j-v[i]]+v[i];
                    vist[i][j]=1;
                }
            }
        }
        for(int i=n,j=m;i>=0;i--)
        {
            if(vist[i][j])
            {
                cout <<v[i]<<" ";
                j-=v[i];
            }
        }
        cout <<"sum:"<<dp[m]<<endl;
    }
    return 0;
}