uva624 CD (01背包+路径的输出)
2015-07-24 13:47
429 查看
CD
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu
Submit Status Practice UVA 624
Appoint description:
Description
Download as PDF
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:
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
Miguel A. Revilla
2000-01-10
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu
Submit Status Practice UVA 624
Appoint description:
Description
Download as PDF
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
Miguel A. Revilla
2000-01-10
//把题目转化为背包问题,即选择尽量多的CD曲子去装满这个时间区间 #include<iostream> #include<algorithm> #include<map> #include<cstdio> #include<cstdlib> #include<vector> #include<cmath> #include<cstring> #include<stack> #include<string> #include<fstream> #define pb(s) push_back(s) #define cl(a,b) memset(a,b,sizeof(a)) #define bug printf("===\n"); using namespace std; typedef vector<int> VI; #define rep(a,b) for(int i=a;i<b;i++) #define rep_(a,b) for(int i=a;i<=b;i++) #define P pair<int,int> #define bug printf("===\n"); #define PL(x) push_back(x) #define X first #define Y second #define vi vector<int> #define rep(i,x,n) for(int i=x;i<n;i++) #define rep_(i,x,n) for(int i=x;i<=n;i++) const int maxn=15000; const int inf=999999999; typedef long long LL; int a[maxn]; int dp[maxn]; int f[maxn][maxn]; int cnt; int ans[maxn]; void print(int n,int m){//是dp的逆过程,递归回去 if(m==0)return ; if(f[m] ){ print(n-a[m],m-1); ans[cnt++]=a[m]; } else { print(n,m-1); } } int main(){ int n,m; while(~scanf("%d%d",&n,&m)){ for(int i=1;i<=m;i++){ scanf("%d",&a[i]); } for(int i=0;i<=n;i++){ dp[i]=0; for(int j=0;j<=n;j++){ f[i][j]=0; } } for(int i=1;i<=m;i++){ for(int j=n;j>=a[i];j--){ dp[j]=max(dp[j],dp[j-a[i]]+a[i]); if(dp[j]==dp[j-a[i]]+a[i]){ f[i][j]=1; } } } cnt=0; print(n,m); for(int i=0;i<cnt;i++){ printf("%d ",ans[i] ); } printf("sum:%d\n",dp ); } return 0; }
相关文章推荐
- UVa 11538 Chess Queen 象棋中的皇后
- Debug和Release区别
- spring mvc 返回json的配置
- SQL Server 锁表、查询被锁表、解锁相关语句
- 学习MVC遇到的问题
- 03SkypeForBusiness2015--Lync2010-2013共存部署Lync2013前端
- go语言学习笔记
- js获取项目根路径
- java异常在实际开发中的应
- mybatis 实现一对一,一对多,多对多关联查询 小结
- java模拟http调用百度识图
- 北航13年机试--十进制数字的科学计数法表示的C语言实现
- 换钱的方法数
- java中通过对象,javabean配置文件,反射属性值
- 转:Struts2返回JSON对象的方法总结
- 飞行棋小项目
- python-__init__.py 与模块对象的关系
- [贪心]HDU1085 Moving Tables
- yii2利用mpdf创建pdf 中文乱码
- PAT (Basic Level) Practise (中文)1015. 德才论 (25) C语言