hdu 3496 Watch The Movie(二维费用的背包问题)
来源:互联网 发布:2017双十一淘宝退货率 编辑:程序博客网 时间:2024/05/16 17:50
Watch The Movie
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3661 Accepted Submission(s): 1164
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
3AC代码:#include <iostream>using namespace std;int MAX(int a,int b){ return a>b?a:b;}int main(){ int vi[105],ti[105],n,m,l,dp[105][1005],t; cin>>t; while(t--) { cin>>n>>m>>l; for(int i=1;i<=n;i++) cin>>ti[i]>>vi[i]; for(int i=0;i<=m;i++) for(int j=0;j<=l;j++) { if(i==0) dp[i][j]=0; else dp[i][j]=-9999999; } for(int i=1;i<=n;i++) for(int j=m;j>=1;j--) //j必须逆序枚举 for(int k=l;k>=ti[i];k--) dp[j][k]=MAX(dp[j][k],dp[j-1][k-ti[i]]+vi[i]); if(dp[m][l]>0) cout<<dp[m][l]<<endl; else cout<<"0"<<endl; } return 0;}
- hdu 3496 Watch The Movie(二维费用的背包问题)
- hdu 3496 Watch The Movie (二维费用背包)
- HDU 3496 Watch The Movie【二维费用的0/1背包问题】
- hdu 3496 Watch The Movie(二维费用的 01背包)
- hdu 3496 Watch The Movie 二维费用背包
- HDU 3496 Watch The Movie( 二维费用背包)
- hdu 3496 Watch The Movie 二维费用背包
- HDU 3496(Watch The Movie)二维费用背包
- HDU 3496 Watch The Movie 二维费用背包
- HDU-3496-Watch The Movie(二维01背包问题)
- hud 3496 Watch The Movie(二维费用背包)
- 动态规划:HDU3496-Watch The Movie(二维费用的背包问题)
- hdu 3496 Watch The Movie(二维背包)
- HDU 3496 Watch The Movie (二维背包)
- HDU 3496 Watch The Movie 二维背包
- HDU 3496 Watch The Movie 二维背包
- 【hdu】 Watch The Movie 【二维费用背包】【dp初始化很重要】
- HDU 3496 Watch The Movie -- 二维费用背包 费用刚好完全消耗
- java.lang.UnsatisfiedLinkError: Unable to load library
- ASP.NET Gridview与checkbox全选、全不选实现代码
- 深入理解Java内存模型(四)——volatile
- golang rand 随机例子
- Unity3d 学习与应用之 DEBUG
- hdu 3496 Watch The Movie(二维费用的背包问题)
- 深入理解Java内存模型(五)——锁
- 黑马程序员—Java语言基础2
- 深入理解Java内存模型(六)——final
- typedef
- Pin与Pintools的一些关键概念的理解
- cdecl和stdcall等函数调用约定(function call convention)的区别与联系
- 深入理解Java内存模型(七)——总结
- 关于在vmware中装苹果系统mac lion10.7无法安装vmtools或无法全屏的问题解决