CD(01背包)
来源:互联网 发布:java 编程 编辑:程序博客网 时间:2024/05/11 16:52
CD
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 minutesOutput
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
#include<stdio.h>#include<string.h>int main(){ int dp[10000],time[10000],sum,cd[25]; int N,m,t; while(scanf("%d%d",&N,&m)>0) { memset(dp,0,sizeof(dp)); dp[0]=1; while(m--) { scanf("%d",&t); for(int v = N; v>=t; v--) if(dp[v-t]&&dp[v]==0) dp[v]=dp[v-t]+1,time[v]=t; } for(sum=N;sum>0;sum--) if(dp[sum]) break; int i=0; for(int j=sum;j>0;j=j-time[j]) cd[++i]=time[j]; for( ;i>0;i--) printf("%d ",cd[i]); printf("sum:%d\n",sum); }}
0 0
- CD(01背包)
- UVA 624 CD (01 背包)
- uva624 CD 01背包 打印路径
- uva624 - CD(动规,01背包问题)
- UVa 624 CD (01背包路径输出)
- UVA 624 CD(DP + 01背包)
- uva 624 - CD(01背包)
- uva 624 CD (01背包+打印路径)
- UVA 624 - CD (01背包打印路径)
- UVA 624 CD(DP:01背包)
- UVA 624 CD 01背包(DP)
- CD - UVa 624 01背包记录路径
- UVa 624 CD (DP 01背包)
- CD+uva+01背包(输出方案)
- UVA 624 - CD(01背包)
- UVA - 624 CD 01背包问题
- UVA - 624 CD (01背包)
- UVA 624 CD 01背包 输出解
- 微信开发(一)公众号接入服务器
- Java基础之IO流知识点总结三
- openwrt编译自定义软件helloworld.ipk
- hdu 1217 Arbitrage (Floyd)
- [LeetCode] Pascal's Triangle
- CD(01背包)
- NYOJ 42
- leetcode:Remove Duplicates from Sorted List
- 模态对话框
- 【Monogdb】MongoDB的介绍以及同类数据库的对比
- 前端精选文摘:BFC 神奇背后的原理
- epoll
- SVN trunk branch tags 区别
- NYOJ 58