【二维费用背包】HDU3496Watch The Movie
来源:互联网 发布:域名一般买几年 编辑:程序博客网 时间:2024/04/30 03:10
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3496
Problem Description
New semester is coming, and DuoDuo has to go to school tomorrow. She decides to have fun tonight and will be very busy after tonight. She like watch cartoon very much. So she wants her uncle to buy some movies and watch with her tonight. Her grandfather gave them L minutes to watch the cartoon. After that they have to go to sleep.
DuoDuo list N piece of movies from 1 to N. All of them are her favorite, and she wants her uncle buy for her. She give a value Vi (Vi > 0) of the N piece of movies. The higher value a movie gets shows that DuoDuo likes it more. Each movie has a time Ti to play over. If a movie DuoDuo choice to watch she won’t stop until it goes to end.
But there is a strange problem, the shop just sell M piece of movies (not less or more then), It is difficult for her uncle to make the decision. How to select M piece of movies from N piece of DVDs that DuoDuo want to get the highest value and the time they cost not more then L.
How clever you are! Please help DuoDuo’s uncle.
DuoDuo list N piece of movies from 1 to N. All of them are her favorite, and she wants her uncle buy for her. She give a value Vi (Vi > 0) of the N piece of movies. The higher value a movie gets shows that DuoDuo likes it more. Each movie has a time Ti to play over. If a movie DuoDuo choice to watch she won’t stop until it goes to end.
But there is a strange problem, the shop just sell M piece of movies (not less or more then), It is difficult for her uncle to make the decision. How to select M piece of movies from N piece of DVDs that DuoDuo want to get the highest value and the time they cost not more then L.
How clever you are! Please help DuoDuo’s uncle.
Input
The first line of the input file contains a single integer t (1 ≤ t ≤ 10), the number of test cases, followed by input data for each test case:
The first line is: N(N <= 100),M(M<=N),L(L <= 1000)
N: the number of DVD that DuoDuo want buy.
M: the number of DVD that the shop can sale.
L: the longest time that her grandfather allowed to watch.
The second line to N+1 line, each line contain two numbers. The first number is the time of the ith DVD, and the second number is the value of ith DVD that DuoDuo rated.
The first line is: N(N <= 100),M(M<=N),L(L <= 1000)
N: the number of DVD that DuoDuo want buy.
M: the number of DVD that the shop can sale.
L: the longest time that her grandfather allowed to watch.
The second line to N+1 line, each line contain two numbers. The first number is the time of the ith DVD, and the second number is the value of ith DVD that DuoDuo rated.
Output
Contain one number. (It is less then 2^31.)
The total value that DuoDuo can get tonight.
If DuoDuo can’t watch all of the movies that her uncle had bought for her, please output 0.
The total value that DuoDuo can get tonight.
If DuoDuo can’t watch all of the movies that her uncle had bought for her, please output 0.
Sample Input
13 2 1011 1001 29 1
Sample Output
3
题目意思:
t,t组测试数据;
n,m,l,n部电影可以购买,最多可以买两部,最长可以看10的时间;
接下来n行表示n部电影,每行两个数据,a[i],b[i]分别表示该电影花的时间和价值;
代码:
#include<iostream>#include<string>#include<cstring>using namespace std;const int inf=1<<29;int dp[1010][1010];int a[110],b[110];int n,m,l;void ZeroOnePack2D() // 二维的01背包,所以要逆序;{ for(int i=0;i<n;i++){ // 枚举电影; for(int j=m;j>=1;j--){ // 电影个数; for(int k=l;k>=a[i];k--){ // 时间; dp[j][k]=max(dp[j][k],dp[j-1][k-a[i]]+b[i]); } } }}int main(){ int t; cin>>t; while(t--){ cin>>n>>m>>l; // n个电影,最多选m个,最多用l的时间看; for(int i=0;i<=m;i++){ for(int j=0;j<=l;j++){ if(i) dp[i][j]=-inf; else dp[i][j]=0; } } for(int i=0;i<n;i++){ cin>>a[i]>>b[i]; // a[i]是要花费的时间,b[i]是价值; } ZeroOnePack2D(); // 求能看的最大价值; if(dp[m][l]>0)cout<<dp[m][l]<<endl; else cout<<'0'<<endl; } return 0;}
Problem Description
New semester is coming, and DuoDuo has to go to school tomorrow. She decides to have fun tonight and will be very busy after tonight. She like watch cartoon very much. So she wants her uncle to buy some movies and watch with her tonight. Her grandfather gave them L minutes to watch the cartoon. After that they have to go to sleep.
DuoDuo list N piece of movies from 1 to N. All of them are her favorite, and she wants her uncle buy for her. She give a value Vi (Vi > 0) of the N piece of movies. The higher value a movie gets shows that DuoDuo likes it more. Each movie has a time Ti to play over. If a movie DuoDuo choice to watch she won’t stop until it goes to end.
But there is a strange problem, the shop just sell M piece of movies (not less or more then), It is difficult for her uncle to make the decision. How to select M piece of movies from N piece of DVDs that DuoDuo want to get the highest value and the time they cost not more then L.
How clever you are! Please help DuoDuo’s uncle.
DuoDuo list N piece of movies from 1 to N. All of them are her favorite, and she wants her uncle buy for her. She give a value Vi (Vi > 0) of the N piece of movies. The higher value a movie gets shows that DuoDuo likes it more. Each movie has a time Ti to play over. If a movie DuoDuo choice to watch she won’t stop until it goes to end.
But there is a strange problem, the shop just sell M piece of movies (not less or more then), It is difficult for her uncle to make the decision. How to select M piece of movies from N piece of DVDs that DuoDuo want to get the highest value and the time they cost not more then L.
How clever you are! Please help DuoDuo’s uncle.
Input
The first line of the input file contains a single integer t (1 ≤ t ≤ 10), the number of test cases, followed by input data for each test case:
The first line is: N(N <= 100),M(M<=N),L(L <= 1000)
N: the number of DVD that DuoDuo want buy.
M: the number of DVD that the shop can sale.
L: the longest time that her grandfather allowed to watch.
The second line to N+1 line, each line contain two numbers. The first number is the time of the ith DVD, and the second number is the value of ith DVD that DuoDuo rated.
The first line is: N(N <= 100),M(M<=N),L(L <= 1000)
N: the number of DVD that DuoDuo want buy.
M: the number of DVD that the shop can sale.
L: the longest time that her grandfather allowed to watch.
The second line to N+1 line, each line contain two numbers. The first number is the time of the ith DVD, and the second number is the value of ith DVD that DuoDuo rated.
Output
Contain one number. (It is less then 2^31.)
The total value that DuoDuo can get tonight.
If DuoDuo can’t watch all of the movies that her uncle had bought for her, please output 0.
The total value that DuoDuo can get tonight.
If DuoDuo can’t watch all of the movies that her uncle had bought for her, please output 0.
Sample Input
13 2 1011 1001 29 1
Sample Output
3
0 0
- 【二维费用背包】HDU3496Watch The Movie
- hdu3496Watch The Movie 二维背包
- HDU3496Watch The Movie (二维背包问题)
- hdu 3496 Watch The Movie 二维费用背包
- 【hdu】 Watch The Movie 【二维费用背包】【dp初始化很重要】
- hud 3496 Watch The Movie(二维费用背包)
- HDU 3496 Watch The Movie( 二维费用背包)
- hdu 3496 Watch The Movie 二维费用背包
- HDU 3496(Watch The Movie)二维费用背包
- hdu 3496 Watch The Movie (二维费用背包)
- HDU3496 Watch The Movie(二维费用背包)
- HDU 3496 Watch The Movie 二维费用背包
- HDU 3496 Watch The Movie -- 二维费用背包 费用刚好完全消耗
- hdu3496-Watch The Movie二维费用DP
- HU 3496 Watch The Movie---二维费用
- TOJ 3596. Watch The Movie【基础的二维费用背包问题】
- hdu 3496 Watch The Movie(二维费用的 01背包)
- hdu 3496 Watch The Movie(二维费用的背包问题)
- [IO]——对象处理流.序列化
- android-universal-image-loader控件中遇到的bug
- Long与Integer的总结
- 代码来解析MRC问题
- 俄罗斯方块游戏中游戏画布和预显画布的实现
- 【二维费用背包】HDU3496Watch The Movie
- 仿百度壁纸客户端(五)——实现搜索动画GestureDetector手势识别,动态更新搜索关键字
- sorted 函数
- 杭州电子科技大学(HDU)ACM 刷题---------字符串处理之1062
- 如何使用classmexer
- hdu 5439 Ponds(长春网络赛——拓扑排序+搜索)
- Android学习笔记(Google官方教程)(三)
- 机器学习在金融大数据风险建模中的应用
- 16 个 Linux 服务器监控命令