UVA624:CD
来源:互联网 发布:金粉世家知乎 编辑:程序博客网 时间:2024/06/06 10:45
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>using namespace std;const int inf=1<<30;#define max(a,b) (a>b?a:b)#define ll long longll sum,n,a[25],tem,maxn,flag;int main(){ ll i,j; while(~scanf("%lld%lld",&sum,&n)) { maxn = -inf; for(i=1; i<=n; i++) scanf("%lld",&a[i]); tem = 1<<n; for(i = 1; i<tem; i++) { ll t=i,k=1,s=0; while(t) { ll r = t%2; t/=2; if(r) { s+=a[k]; } k++; } if(s<=sum && s>=maxn) { maxn = max(maxn,s); flag = i; } } ll k = 1; while(flag) { ll r = flag%2; flag/=2; if(r) { printf("%lld ",a[k]); } k++; } printf("sum:%lld\n",maxn); } return 0;}
0 0
- UVA624:CD
- uva624-CD(背包)
- [动态规划]UVA624 - CD
- UVA624 - CD (DFS)
- Uva624 CD (记录路径)
- uva624 CD 01背包 打印路径
- uva624 - CD(动规,01背包问题)
- uva624 - CD(01背包+打印路径)
- uva624 CD 01背包+输出路径
- uva624
- UVA624
- uva624 CD (01背包+路径的输出)
- uva624(DP)
- (未完全)uva624
- uva624(0-1背包)
- ..CD..
- CD
- cd
- Servlet的生命周期
- Question and answer
- 巧用java自定义注解和反射
- git 删除远程分支
- JavaScript总结-网页上显示时间
- UVA624:CD
- boost::asio::ip::tcp实现网络通信的小例子
- 迷雾重重,可爱又可恨的促销,你中招了吗
- android DownloadManager广播事件:下载完成、通知栏点击事件
- undefined reference问题总结
- hdu 3376 Matrix Again【最大费用流】
- 利用UIScrollView实现图片的缩放
- Two Sum,3Sum,3Sum Closest,4Sum
- ActiveMq5.10 maven入门实例