uva624 CD (01背包+路径的输出)
来源:互联网 发布:生产计划编制软件 编辑:程序博客网 时间:2024/06/05 22:49
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:
number of tracks on the CD. does not exceed 20no track is longer than N minutestracks do not repeatlength of each track is expressed as an integer numberN 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][n]){ 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[n]); } return 0;}
- uva624 CD (01背包+路径的输出)
- uva624 CD 01背包+输出路径
- uva624 - CD(01背包+打印路径)
- uva624 CD 01背包 打印路径
- uva624-CD(背包)
- Uva624(记录路径的01背包)
- Uva624 CD (记录路径)
- uva624(01背包+打印路径)
- uva624 - CD(动规,01背包问题)
- UVA624(01背包 + 路径打印)
- UVA 题目624 CD(01背包输出路径啊)
- UVa 624 CD (01背包路径输出)
- UVA 264 CD (01背包+输出路径)
- UVA 624CD(打印路径的01背包)
- CD+uva+01背包(输出方案)
- UVA 624 CD(01背包输出)
- UVA624:CD
- 01背包问题【简单背包,UVA624】
- java模拟http调用百度识图
- js获取项目根路径
- LeetCode——复制图
- android studio 程序真机运行中文显示乱码
- GRE写作必备句型
- uva624 CD (01背包+路径的输出)
- Debug和Release区别
- iOS Sprite Kit教程之申请和下载证书
- C++ 线程(一)
- 【读书笔记】程序员的自我修养:链接、装载与库 第一章 温故而知新
- python 黑名单过滤
- Servlet 单例多线程
- “无法找到“xxx.exe”的调试信息,或者调试信息不匹配。未使用调试信息生成二进制文件。”
- SYN攻击防护措施