HDU 3496 Watch The Movie (背包)

最新推荐文章于 2021-05-24 20:41:15 发布

原创最新推荐文章于 2021-05-24 20:41:15 发布 · 577 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#acm #动态规划 #dp #背包

动态规划专栏收录该内容

98 篇文章

订阅专栏

http://acm.hdu.edu.cn/showproblem.php?pid=3496

Watch The Movie

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 5159 Accepted Submission(s): 1634

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.

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.

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.

Sample Input

Sample Output

题意：有商品个数限制的背包问题。

在普通的背包问题上再开一维表示已经买了的商品的个数。dp[i][j][k]表示前i个物品，花费为j，已经买了K个商品的最大价值。

转移方程为：

dp[i][j][k]=max(dp[i-1][j][k],dp[i-1][j-v][k-1]+w)。代码如下：

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<algorithm>
#include<queue>
#include<stack>
#define nn 110
#define inff 0x3fffffff
#define mod 1000000007
using namespace std;
typedef long long LL;
int n,m,l;
int w[nn],v[nn];
int dp[110][1100][110];
int main()
{
    int t,i,j,k;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&m,&l);
        for(i=1;i<=n;i++)
        {
            scanf("%d%d",&w[i],&v[i]);
        }
        for(i=0;i<=n;i++)
        {
            for(j=0;j<=l;j++)
            {
                for(k=0;k<=m;k++)
                    dp[i][j][k]=-inff;
            }
        }
        dp[0][0][0]=0;
        for(i=1;i<=n;i++)
        {
            for(j=l;j>=0;j--)
            {
                for(k=m;k>=0;k--)
                {
                    dp[i][j][k]=dp[i-1][j][k];
                    if(j-w[i]>=0&&k>=1)
                        dp[i][j][k]=max(dp[i][j][k],dp[i-1][j-w[i]][k-1]+v[i]);
                }
            }
        }
        int ans=-inff;
        for(i=0;i<=l;i++)
            ans=max(ans,dp[n][i][m]);
        printf("%d\n",max(0,ans));
    }
    return 0;
}