Zoj 3956 Course Selection System (01背包)
来源:互联网 发布:科比详细身体数据 编辑:程序博客网 时间:2024/06/06 06:56
There are n courses in the course selection system of Marjar University. The i-th course is described by two values: happiness Hi and credit Ci. If a student selects m courses x1, x2, ..., xm, then his comfort level of the semester can be defined as follows:
Edward, a student in Marjar University, wants to select some courses (also he can select no courses, then his comfort level is 0) to maximize his comfort level. Can you help him?
Input
There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:
The first line contains a integer n (1 ≤ n ≤ 500) -- the number of cources.
Each of the next n lines contains two integers Hi and Ci (1 ≤ Hi ≤ 10000, 1 ≤ Ci ≤ 100).
It is guaranteed that the sum of all n does not exceed 5000.
We kindly remind you that this problem contains large I/O file, so it's recommended to use a faster I/O method. For example, you can use scanf/printf instead of cin/cout in C++.
Output
For each case, you should output one integer denoting the maximum comfort.
Sample Input
2310 15 12 1021 102 10
Sample Output
1910
Hint
For the first case, Edward should select the first and second courses.
For the second case, Edward should select no courses.
题意: 给你n个hi, ci,问你怎样拿才能让你 使上面式子最大。。
思路:一开始想的是hi,ci差的越大越好、、一直没发现c的范围小了。。。为什么hi,ci,ci突然小了。。然后发现c确定的情况下,h越大越好。。所以背包就好了,找出每个容量对应的最大h
#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;typedef long long ll;const int maxn = 5e4 + 5;const ll INF = 1e15;ll dp[maxn], h[maxn], c[maxn];int main(){ int t, n; scanf("%d", &t); while(t--) { scanf("%d", &n); for(int i = 1; i <= n; i++) scanf("%lld%lld", &h[i], &c[i]); for(int i = 1; i <= maxn; i++) dp[i] = -INF; //最好装满,但这题没影响// memset(dp, 0, sizeof(dp)); dp[0] = 0; for(int i = 1; i <= n; i++) { for(int v = maxn; v >= c[i]; v--) { dp[v] = max(dp[v], dp[v-c[i]]+h[i]); } } ll ans = 0; for(ll i = 1; i < maxn; i++) { if(dp[i] > 0) ans = max(dp[i]*dp[i]-dp[i]*i-i*i, ans); } printf("%lld\n", ans); } return 0;}
- ZOJ 3956 Course Selection System 01背包
- Zoj 3956 Course Selection System【01背包】
- ZOJ 3956 Course Selection System 01背包
- ZOJ-3956 Course Selection System,01背包!
- ZOJ-3956 Course Selection System(01背包)
- zoj 3956-Course Selection System(背包)
- ZOJ 3956 Course Selection System(01背包)
- Zoj 3956 Course Selection System (01背包)
- ZOJ 3956 Course Selection System (dp 01背包)
- 浙大17年校赛(ZOJ 3956)Course Selection System[01背包]
- ZOJ 3956 Course Selection System 01背包变形
- 浙大校赛 ZOJ 3956Course Selection System (01背包)
- ZOJ 3956 Course Selection System(01背包变形)
- ZOJ 3956 Course Selection System 【 思维 + 01背包 】
- ZOJ 3956 Course Selection System (dp)
- zoj 3596Course Selection System(dp,01背包)
- ZOJ 3956 Course Selection System
- ZOJ 3956 Course Selection System
- ZOJ 3954 Seven-Segment Display (预处理)
- Windows、Office2010,2013激活神器HEU_KMS_Activator_v7.8.6
- 【iOS开发】 jenkins 指定gitlab上的源码时,提示无权限
- JAVA单例模式
- 面向对象:ATM的问题陈述、词汇表和领域类图
- Zoj 3956 Course Selection System (01背包)
- 【MATLAB】MATLAB的基础知识
- 最小生成树
- 树状数组和线段树(未完)
- mql----Program Run 程序运行
- Group By
- 本地连接服务器mysql
- 【软件工具】CSDN中如何转载别人的文章
- [HDU 4864]Task:贪心