UVA12563 0-1背包 (一位数组)
来源:互联网 发布:过山车大亨中文版 mac 编辑:程序博客网 时间:2024/05/16 13:06
(If you smiled when you see the title, this problem is for you ^_^)For those who don’t know KTV, see: http://en.wikipedia.org/wiki/Karaoke_boxThere is one very popular song called Jin Ge Jin Qu(). It is a mix of 37 songs, and is extremelylong (11 minutes and 18 seconds) — I know that there are Jin Ge Jin Qu II and III, and some otherunofficial versions. But in this problem please forget about them.Why is it popular? Suppose you have only 15 seconds left (until your time is up), then you shouldselect another song as soon as possible, because the KTV will not crudely stop a song before it ends(people will get frustrated if it does so!). If you select a 2-minute song, you actually get 105 extraseconds! ....and if you select Jin Ge Jin Qu, you’ll get 663 extra seconds!!!Now that you still have some time, but you’d like to make a plan now. You should stick to thefollowing rules:
• Don’t sing a song more than once (including Jin Ge Jin Qu)
.• For each song of length t, either sing it for exactly t seconds, or don’t sing it at all
• When a song is finished, always immediately start a new song.Your goal is simple: sing as many songs as possible, and leave KTV as late as possible (since wehave rule 3, this also maximizes the total lengths of all songs we sing) when there are ties.
Input
The first line contains the number of test cases T (T ≤ 100). Each test case begins with two positiveintegers n, t (1 ≤ n ≤ 50, 1 ≤ t ≤ 109), the number of candidate songs (BESIDES Jin Ge Jin Qu)and the time left (in seconds). The next line contains n positive integers, the lengths of each song, inseconds. Each length will be less than 3 minutes — I know that most songs are longer than 3 minutes.But don’t forget that we could manually “cut” the song after we feel satisfied, before the song ends.So here “length” actually means “length of the part that we want to sing”.It is guaranteed that the sum of lengths of all songs (including Jin Ge Jin Qu) will be strictly largerthan t.
Output
For each test case, print the maximum number of songs (including Jin Ge Jin Qu), and the total lengthsof songs that you’ll sing.Explanation:In the first example, the best we can do is to sing the third song (80 seconds), then Jin Ge Jin Qufor another 678 seconds.In the second example, we sing the first two (30+69=99 seconds). Then we still have one secondleft, so we can sing Jin Ge Jin Qu for extra 678 seconds. However, if we sing the first and third songinstead (30+70=100 seconds), the time is already up (since we only have 100 seconds in total), so wecan’t sing Jin Ge Jin Qu anymore!
Sample Input
2
3 100
60 70 80
3 100
30 69 70
Sample Output
Case 1: 2 758
Case 2: 3 777
KTV里面有n首歌曲你可以选择,每首歌曲的时长都给出了. 对于每首歌曲,你最多只能唱1遍. 现在给你一个时间限制t (t<=10^9) , 问你在最多t-1秒的时间内可以唱多少首歌曲num , 且最长唱歌时间是多少time (time必须<=t-1) ? 最终输出num+1 和 time+678 即可.
注意: 你需要优先让歌曲数目最大的情况下,再去选择总时长最长的.
#include "stdio.h"#include "string.h"#include "algorithm"using namespace std;int dp[1000000];int main(){int time[60];int kk;scanf("%d",&kk);int kkk=0;while (kk--){kkk++;int n,t;scanf("%d%d",&n,&t);for(int i=1;i<=n;i++){scanf("%d",&time[i]);}//printf("####\n");memset(dp,0,sizeof(dp));int maxd=0;for(int i=1;i<=n;i++){for(int j=t-1;j>=time[i];j--){//dp[i][j]=(i==0?0:dp[i-1][j]);if(j==time[i]||dp[j - time[i]] >= 1){dp[j]=max(dp[j],dp[j-time[i]]+1);if(dp[j]>=maxd )maxd=dp[j];} }}//printf("####\n");int j;for( j=t-1;j>=0;j--){if(dp[j]==maxd){break;}}if(maxd==0)printf("Case %d: %d %d\n",kkk,1,678);elseprintf("Case %d: %d %d\n",kkk,maxd+1,j+678);}}
- UVA12563 0-1背包 (一位数组)
- UVA12563 0-1背包变形
- uva12563(01背包)
- 【UVa12563劲歌金曲】0-1背包+小技巧
- UVA12563 01背包
- UVA12563 Jin Ge Jin Qu hao(DP, 背包+技巧)
- UVA12563 - Jin Ge Jin Qu hao(01背包)
- UVA12563: Jin Ge Jin Qu hao(类01背包)
- UVA12563 01背包的变形
- uva12563
- UVA12563
- uva12563
- UVa12563
- 一位数组(打印分开)
- UVA12563 Jin Ge Jin Qu hao(背包问题)
- UVa12563--Jin Ge Jin Qu hao DP(01背包)
- UVa12563 -Jin Ge Jin Qu hao(DP) 01背包
- 一位数组
- LibSvm的使用
- 在fragment中添加点击事件,给Linearlayout添加点击监听
- 树状数组详解
- JSP格式化时间
- 最优化中的鞍点
- UVA12563 0-1背包 (一位数组)
- Android 服务与多线程——编写简单的音乐播放器程序
- 南阳oj 106 背包问题
- PHP基于数组的分页函数(核心函数array_slice())
- sphinx介绍和原理
- Desktop Duplication API(桌面拷贝API)
- 转录组测序分析中cufflinks的使用及问题
- Python 的类的下划线命名有什么不同?
- 赠给XJ的代码规范