UVA - 624 - CD (动态规划)
来源:互联网 发布:生理学软件 编辑:程序博客网 时间:2024/05/17 06:26
UVA - 624
CD
Time Limit: 3000MS Memory Limit: Unknown 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 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
Miguel A. Revilla
2000-01-10
Source
Root :: AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 5. Dynamic Programming
Root :: Competitive Programming 2: This increases the lower bound of Programming Contests. Again (Steven & Felix Halim) :: Problem Solving Paradigms :: Complete Search :: Recursive Backtracking (The Easier Ones)
Root :: Competitive Programming: Increasing the Lower Bound of Programming Contests (Steven & Felix Halim) :: Chapter 3. Problem Solving Paradigms :: Complete Search :: Recursive Backtracking
Root :: Competitive Programming 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: Problem Solving Paradigms :: Complete Search :: Recursive Backtracking (Easy)
Root :: Competitive Programming 2: This increases the lower bound of Programming Contests. Again (Steven & Felix Halim) :: Problem Solving Paradigms :: Complete Search :: Recursive Backtracking (The Easier Ones)
Root :: Competitive Programming: Increasing the Lower Bound of Programming Contests (Steven & Felix Halim) :: Chapter 3. Problem Solving Paradigms :: Complete Search :: Recursive Backtracking
Root :: Competitive Programming 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: Problem Solving Paradigms :: Complete Search :: Recursive Backtracking (Easy)
思路:01背包问题,就是把体积和重量看做了tracks和time,这里注意打印路径的方法
AC代码:
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn= 10005;int dp[30][maxn], path[30][maxn];int M, N;int ti[30];void print(int a, int b) {if(a == 0) return;print(a - 1, path[a][b]);if(path[a][b] < b) printf("%d ", ti[a]);}int main() {while(scanf("%d", &M) != EOF) {scanf("%d", &N);for(int i = 1; i <= N; i++) {scanf("%d", &ti[i]);}memset(dp, 0, sizeof(dp));for(int i = 1; i <= N; i ++) {for(int j = 0; j <= M; j ++) {dp[i][j] = dp[i - 1][j];path[i][j] = j;//第i个不选时赋值为j;if(j >= ti[i]) {int tmp = dp[i - 1][j - ti[i]] + ti[i];if(tmp > dp[i][j]) {dp[i][j] = tmp;path[i][j] = j - ti[i];//第i个选了时赋值为j - ti[i]; }}}}print(N, M);//递归打印路径 printf("sum:%d\n", dp[N][M]);}return 0;}
0 0
- UVA - 624 - CD (动态规划)
- 动态规划 UVa 624 CD
- UVA - 624 - CD(动态规划,背包,打印路径)
- 【UVA】624-CD(动态规划01背包问题)
- [动态规划]UVA624 - CD
- UVA 624 CD (DP)
- UVA-624 CD (DP)
- UVA 1638(动态规划)
- uvaoj 624 CD 动态规划 01背包 记录答案
- uva 624 - CD(01背包)
- UVA 624 CD 01背包(DP)
- UVa 624 CD (DP 01背包)
- UVA 624 - CD(01背包)
- UVA - 624 CD (01背包)
- UVA 624 CD(01背包输出)
- uva 624 CD (01背包)
- uva 624 CD(记录路径)
- UVA 624 CD (01背包)
- C++游戏之透明贴图(四)
- ListView控件和如何向ListView控件添加数据适配器
- 为什么析构函数常常声明为虚函数
- SQL Server 优化存储过程的七种方法
- 三星NOTE3 N900 刷机
- UVA - 624 - CD (动态规划)
- 循环数组求最大子段和系列-----------方法1
- android系统自带的字体外观
- 顺序统计
- 剖析Activity
- javascript语言扩展:可迭代对象(3)
- hdu5191
- 黑马程序员——Java面向对象知识点(一)
- zendframework+composer+certificate verify failed