UVA 624 CD
来源:互联网 发布:优化黑龙江发展环境 编辑:程序博客网 时间:2024/06/05 15:03
CD
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu
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 tapeN 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
Miguel A. Revilla
2000-01-10
用数组记录一下即可
#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>using namespace std;int n,m;int a[25];int dp[10001],vis[10001][25];int main(){while(cin >> n >> m){for(int i = 0;i < m;i++){cin >> a[i];}memset(dp,0,sizeof(dp));memset(vis,0,sizeof(vis));for(int i = 0; i< m;i++){for(int j = n; j >= a[i];j--){if(dp[j] < dp[j-a[i]] + a[i]){dp[j] = dp[j-a[i]] + a[i];vis[j][i] = 1;}}}for(int i = m -1,j = n;i >= 0;i--){if(vis[j][i]){printf("%d ",a[i]);j -= a[i]; }}printf("sum:%d\n",dp[n]);}return 0;}
0 0
- uva 624 CD
- UVa 624 - CD
- Uva 624 CD
- UVA 624 CD
- UVa 624 - CD
- UVa 624 - CD
- uva 624 CD
- uva 624 CD
- UVa 624 - CD
- UVa 624 CD
- Uva-624-CD
- CD UVA 624
- UVA 624 CD
- UVA 624 - CD
- UVa:624 CD
- UVa 624: CD
- UVA - 624 CD
- uva 624 cd
- c# 第一次调用webservice很慢的解决方法
- Oracle Scheduler Chain 的用法
- Intent意图
- 怎样执行一段存放在字符串变量里面的java代码
- SQLite
- UVA 624 CD
- 模板函数与模板类
- ORACLE 用户权限与管理
- tomcat 协议之并发协议 Http11NioProtocol
- 树莓派的使用(一)之系统安装
- JNI调用c/c++,env->和(*env)->是有区别的
- UVA-11809Floating-Point Numbers
- Remove Duplicates from Sorted List
- SqlServer代理执行[分发清除: distribution] 无法删除快照文件