HDU3496:Watch The Movie(二维01背包)
来源:互联网 发布:mac gradle 安装配置 编辑:程序博客网 时间:2024/04/30 06:34
Watch The Movie
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 7280 Accepted Submission(s): 2310
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
题意:给出朵朵想买的碟子数,店子能卖的碟子数,祖父允许能看的时间长度
然后各处所有朵朵想买的碟子的时间长度与价值,求出能得到的最大价值。
#include <stdio.h>#include <string.h>#include <math.h>#include <algorithm>using namespace std;int dp[102][1002];int main(){ int T;scanf("%d",&T); while(T--){ int N,M,L;scanf("%d%d%d",&N,&M,&L); memset(dp,-1,sizeof(dp)); for(int i=0;i<=L;i++) dp[0][i]=0; for(int i=0;i<N;i++) { int time,value; scanf("%d%d",&time,&value); for(int j=M;j>=1;j--) for(int k=L;k>=time;k--) dp[j][k]=max(dp[j][k],dp[j-1][k-time]+value); }//for if(dp[M][L]<0) printf("0\n"); else printf("%d\n",dp[M][L]); } return 0;}
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;const int MAX = 999999;int val[111],time[111],dp[111][1111];int main(){ int t; scanf("%d",&t); while(t--) { int n,m,l; scanf("%d%d%d",&n,&m,&l); int i,j,k; for(i = 0; i<n; i++) scanf("%d%d",&time[i],&val[i]); for(i = 0; i<=m; i++) { for(j = 0; j<=l; j++) { if(i==0) dp[i][j] = 0; else dp[i][j] = -MAX;//价值可能为负数 } } for(i = 0; i<n; i++)//状态转移 { for(j = m; j>=1; j--) { for(k = l; k>=time[i]; k--) { dp[j][k] = max(dp[j][k],dp[j-1][k-time[i]]+val[i]); } } } if(dp[m][l]<0) dp[m][l] = 0; printf("%d\n",dp[m][l]); } return 0;}
1 0
- HDU3496:Watch The Movie(二维01背包)
- HDU3496:Watch The Movie(二维01背包)
- hdu3496 Watch The Movie(二维01背包)
- hdu3496 Watch The Movie (二维背包)
- hdu3496 Watch The Movie(二维01背包)
- HDU3496:Watch The Movie(二维01背包)
- HDU3496 Watch The Movie(二维费用背包)
- HDU3496 Watch the moive (二维01背包)
- hdu3496-Watch The Movie二维费用DP
- hdu3496 Watch The Movie
- HDU3496:Watch The Movie
- HDU3496-Watch The Movie
- 动态规划:HDU3496-Watch The Movie(二维费用的背包问题)
- HDU 3496 Watch The Movie (二维背包+01背包)
- HDU 3496 Watch The Movie(二维01背包)
- hdu 3496 Watch The Movie 二维01背包
- hdu 3496 Watch The Movie(二维01背包)
- hdu 3496 Watch The Movie(二维01背包)
- runtime的简单理解
- Android应用层使用共享内存机制进行进程间交换数据
- Doing Homework hdu 1074 集合dp+字典序输出
- ListView异步加载图片--图片缓存和错位问题解决方案
- SSM框架的基本搭建(Spring+Struts+Mybatis)
- HDU3496:Watch The Movie(二维01背包)
- Android短信和拨打电话
- Tomcat服务器安全目录问题
- deferred render
- Effective C++:绝不重新定义继承而来的缺省参数值
- c语言之左右法则
- sqlite 数据库开发中一些用法
- 使用Maven 整合Spring和hibernate 适合初级接触的学者
- 设计模式之适配器模式