zoukankan      html  css  js  c++  java
  • UVA 624 CD(DP + 01背包)

    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
    

    题意:给定一个时间上限和n个cd盘,每个cd有一个播放时间,要求出不超过时间上限的情况下最多的可以播放的时间以及使用的cd。

    思路:01背包。状态转移方程为dp[j - cd[i] == 1 ? dp[j] = 1 : dp[j] = 0。就是多个要保存下路径。挺裸的一题

    代码;

    #include <stdio.h>
    #include <string.h>
    #include <algorithm>
    using namespace std;
    
    int sum, n, cd[25], i, j, k, dp[1111], out[1111][25], outn[1111];
    
    int main() {
    	while (~scanf("%d", &sum)) {
    		scanf("%d", &n);
    		memset(dp, 0, sizeof(dp));
    		memset(out, 0, sizeof(out));
    		memset(outn, 0, sizeof(outn));
    		dp[0] = 1;
    		for (i = 0; i < n; i ++)
    			scanf("%d", &cd[i]);
    		for (i = 0; i < n; i ++)
    			for (j = sum; j >= cd[i]; j --) {
    				if (dp[j - cd[i]] && !dp[j]) {
    					dp[j] = 1;
    					for (k = 0; k < outn[j - cd[i]]; k ++)
    						out[j][outn[j] ++] = out[j - cd[i]][k];
    					out[j][outn[j] ++] = cd[i];
    				}
    			}
    		for (i = sum; i >= 0; i --) {
    			if (dp[i]) {
    				sort(out[i], out[i] + outn[i]);
    				for (j = 0; j < outn[i]; j ++) {
    					printf("%d ", out[i][j]);
    				}
    				printf("sum:%d
    ", i);
    				break;
    			}
    		}
    	}
    	return 0;
    }


  • 相关阅读:
    H5页面获取屏幕宽高
    装修注意事项
    两列等高布局
    html/css
    css的几种垂直水平居中方法
    3分钟看懂flex布局
    Android手机里H5页面滚动图片时出现白屏
    JavaScript正则表达式——函数
    javascript正则表达式——语法
    【react】子组件向父组件传值
  • 原文地址:https://www.cnblogs.com/suncoolcat/p/3283359.html
Copyright © 2011-2022 走看看