C. Dima and Salad----01背包
来源:互联网 发布:parallels mac 破解版 编辑:程序博客网 时间:2024/06/06 14:08
Dima, Inna and Seryozha have gathered in a room. That's right, someone's got to go. To cheer Seryozha up and inspire him to have a walk, Inna decided to cook something.
Dima and Seryozha have n fruits in the fridge. Each fruit has two parameters: the taste and the number of calories. Inna decided to make a fruit salad, so she wants to take some fruits from the fridge for it. Inna follows a certain principle as she chooses the fruits: the total taste to the total calories ratio of the chosen fruits must equal k. In other words, , where aj is the taste of the j-th chosen fruit and bj is its calories.
Inna hasn't chosen the fruits yet, she is thinking: what is the maximum taste of the chosen fruits if she strictly follows her principle? Help Inna solve this culinary problem — now the happiness of a young couple is in your hands!
Inna loves Dima very much so she wants to make the salad from at least one fruit.
The first line of the input contains two integers n, k (1 ≤ n ≤ 100, 1 ≤ k ≤ 10). The second line of the input contains n integersa1, a2, ..., an (1 ≤ ai ≤ 100) — the fruits' tastes. The third line of the input contains n integers b1, b2, ..., bn (1 ≤ bi ≤ 100) — the fruits' calories. Fruit number i has taste ai and calories bi.
If there is no way Inna can choose the fruits for the salad, print in the single line number -1. Otherwise, print a single integer — the maximum possible sum of the taste values of the chosen fruits.
3 210 8 12 7 1
18
5 34 4 4 4 42 2 2 2 2
-1
In the first test sample we can get the total taste of the fruits equal to 18 if we choose fruit number 1 and fruit number 2, then the total calories will equal 9. The condition fulfills, that's exactly what Inna wants.
In the second test sample we cannot choose the fruits so as to follow Inna's principle.
题目链接:http://codeforces.com/contest/366/problem/C
题目的意思是说给你n个物品,每个物品有两个值a[i]和b[i],求一个方案满足上述函数式,若没有方案,输出-1。
感谢大佬的背包思路http://blog.csdn.net/rowanhaoa/article/details/16959443让我想到了自己的背包思路。
每个物品的耗费是a[i]-k*b[i]的物品,这样就可以转化为01背包,求dp[i][0],但是这样算耗值可能是负值,所以我们数组平移n*100个单位,就可以求出dp[n][m]。
代码:
#include <cstdio>#include <cstring>#include <iostream>using namespace std;int dp[105][300000];int main(){int i,j,n,m,k,val[105],cost;scanf("%d%d",&n,&k); m=n*100; memset(dp,192,sizeof(dp)); dp[0][m]=0; for(i=1;i<=n;i++){ scanf("%d",val[i]); } for(i=1;i<=n;i++){ scanf("%d",&cost); cost=val[i]-k*cost; for(j=2*m;j>=0;j--){ dp[i][j]=max(dp[i-1][j],dp[i-1][j-cost]+val[i]); } } printf("%d\n",dp[n][m]?dp[n][m]:-1);return 0;}
- C. Dima and Salad----01背包
- codeforces 366C Dima and Salad (01背包)
- CodeForces - 366C Dima and Salad (DP&01背包)
- CodeForces 366C-Dima and Salad【01背包】
- Codeforces 366C Dima and Salad【01背包】好题
- C. Dima and Salad
- 366C - Dima and Salad(0-1 背包)
- Codeforces 366C Dima and Salad 背包DP
- COdedorce 366 C Dima and Salad 题解(隐形01背包,好题)
- CodeForces366C. Dima and Salad(01背包变形好题)
- CodeForces 366C Dima and Salad
- cf-366C-Dima and Salad
- CF 366 C. Dima and Salad
- Codeforces 366C Dima and Salad 【dp】
- codeforces 366 C Dima and Salad dp
- CodeForces 366C Dima and Salad
- Codeforces Round #214 (Div. 2) C. Dima and Salad (背包变形)
- Codeforces 366C Dima and Salad (背包变形,DP好题)
- String、StringBuffer与StringBuilder之间区别
- 初学者---简介java中的对象和类(2)
- [Git] 修改之前某次 commit 日志和内容
- 检测到在集成的托管管道模式下不适用的ASP.NET设置的解决方法(非简单设置为【经典】模式)。
- C#使用ftp
- C. Dima and Salad----01背包
- kotlin基本语法
- 小程序中跳转的实现和url传递参数
- MongoDB 同步 Hive 的两种方式
- easyui-combobox 加载完数据后默认选择其中项
- 详解centos6和centos7防火墙的关闭
- 运用@media实现网页自适应中的几个关键分辨率
- 如何在改变mfc控件上文字的字体和颜色
- 【Mybatis源码分析】Mybatis源码分析-数据库连接池