zoukankan      html  css  js  c++  java
  • CD

      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 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

    要经历N分钟长的时间,如何选择带子可以尽可能的利用时间

    每个CD的时间不超过 20
    没有哪个CD的时间是超过N的
    CD不能重复
    每个长度和N都是一个整数

    数据:
    一个N代表时间, M代表有M个CD

    分析:
    其实就是0-1背包+打印路径

     1 #include <iostream>
     2 #include <cstdlib>
     3 #include <cstdio>
     4 #include <algorithm>
     5 #include <vector>
     6 #include <queue>
     7 #include <cmath>
     8 #include <stack>
     9 #include <cstring>
    10 
    11 using namespace std;
    12 
    13 #define INF 0xfffffff
    14 #define maxn 2000
    15 #define min(a,b) (a<b?a:b)
    16 #define max(a,b) (a>b?a:b)
    17 int w[maxn];
    18 int dp[maxn][maxn];
    19 
    20 void Path(int m,int n)   //  路径
    21 {
    22     if( m == 0)
    23         return ;
    24 
    25     if(dp[m][n] == dp[m-1][n])
    26         Path(m-1, n);
    27     else
    28     {
    29         Path(m-1, n-w[m]);
    30         printf("%d ",w[m]);
    31     }
    32 }
    33 int main()
    34 {
    35     int n, m;
    36 
    37     while(cin >> n >> m)
    38     {
    39         memset(dp,0,sizeof(dp));
    40 
    41         for(int i = 1; i<=m; i++)
    42             cin >> w[i];
    43 
    44         for(int i = 1; i<=m; i++)
    45         {
    46             for(int j=0; j<=n; j++)
    47             {
    48                 if(j<w[i])
    49                     dp[i][j] = dp[i-1][j];
    50                 else
    51                     dp[i][j] = max(dp[i-1][j], dp[i-1][j-w[i]]+w[i]);  // 
    52             }
    53         }
    54         Path(m,n);
    55 
    56         printf("sum:%d
    ", dp[m][n]);
    57     }
    58     return 0;
    59 }
    让未来到来 让过去过去
  • 相关阅读:
    Tornado之异步authenticated
    使用Tornado和协程爬取博客园文章
    Python协程与asyncio
    Mr.Jin系统发布报告——WIN7 WIN8双系统下的学习模式系统
    Matlab:fsolve No solution found.
    Matlab R2016b下载 安装及破解教程
    第一行代码近期bug及解决
    Android Studio打包生成APK教程
    Notification通知在OPPO手机上不弹出提示?
    Android Studio如何在命令提示符中使用ADB指令
  • 原文地址:https://www.cnblogs.com/Tinamei/p/4732438.html
Copyright © 2011-2022 走看看