简单dp

题目：
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.

大致题意：
你前面有一段很长的车程。你有录音机，但不幸的是你最好的音乐还在播放

CD。你需要把它录在磁带上，所以要解决的问题是：你的磁带有N分钟长。怎么

从CD中选择曲目以充分利用磁带空间，并尽可能缩短未使用的空间。

假设：

•CD上的曲目数量不超过20首

•音轨长度不超过N分钟

•音轨不重复

•每条轨道的长度表示为整数

•N也是整数

程序应该找到最能填满磁带的磁道集，并按与

曲目存储在CD上

题解：
一道简单dp题，因为对一首歌只有录与不录两种选择，我们就可以用递归模拟出全部情况，选出时间最长的一种情况，即可解题。

代码如下：

#include<iostream>
#include<algorithm>

using namespace std;

int n,t,CD[20],ans[20],sum,d;

void dp(int num,int time,int a[20],int w)
{
	if(time>n) return ;
	if(num==t+1) return ;
	if(sum<time)
	{
		for(int i=0;i<t;i++) ans[i]=a[i];
		sum=time;
		d=w;
	}
	dp(num+1,time,a,w);
	a[w]=CD[num];
	dp(num+1,time+CD[num],a,w+1);

}

int main()
{
	int a[20];
	while(cin>>n>>t)
	{
		for(int i=0;i<t;i++) cin>>CD[i];
		dp(0,0,a,0);
		for(int i=0;i<d;i++) cout<<ans[i]<<" ";
		cout<<"sum:"<<sum<<endl;
		sum=0;
	}
	return 0;
}