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 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
题目大意:要录制时间为w的带子,有n个CD,每个CD的时长为a[i],要求最后总时间最接近w,并记录加入带子的CD的时间。
思路:这是一道背包题,直接用01背包的模板,开一个数组vis记录一下CD是否加入带子。
代码:
#include<stdio.h>
#include<algorithm>
#include<string.h>
#define N 10005
using namespace std;
int a[N],d[N];
bool vis[25][N];
int main()
{
int n,w;
while(~scanf("%d%d",&w,&n))
{
memset(a,0,sizeof(a));
memset(d,0,sizeof(d));
memset(vis,0,sizeof(vis));
for(int i=0; i<n; i++)
scanf("%d",&a[i]);
for(int i=0; i<n; i++)
{
for(int j=w; j>=a[i]; j--)
{
if(d[j]<=d[j-a[i]]+a[i])
{
d[j]=d[j-a[i]]+a[i];
vis[i][j]=1;
}
}
}
for(int i=n-1,j=w; i>=0; i--)
{
if(vis[i][j])
{
printf("%d ",a[i]);
j-=a[i];
}
}
printf("sum:%d\n",d[w]);
}
return 0;
}