ZOJ 3956 Course Selection System(01背包)
来源:互联网 发布:nginx宕机原因 编辑:程序博客网 时间:2024/06/06 05:34
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.
思路:由给出的公式我们可以知道C固定时,H越大越好,因为C的总和最大50000,所
以我们可以通过01背包计算出每个C能得到的最大的H,复杂度∑C*N。
#include<iostream>#include<cstdio>#include<cstring>using namespace std;typedef long long ll;const int maxn = 50005;ll n, dp[maxn], h[maxn], c[maxn];int main(void){ int t; cin >> t; while(t--) { memset(dp, 0, sizeof(dp)); scanf("%lld", &n); for(int i = 1; i <= n; i++) { scanf("%lld%lld", &h[i], &c[i]); for(int j = maxn-1; j >= c[i]; j--) dp[j] = max(dp[j], dp[j-c[i]]+h[i]); } ll ans = 0; for(ll i = 0; i < maxn; i++) ans = max(ans, dp[i]*dp[i]-dp[i]*i-i*i); 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
- XMU 1040 Schedule 【拓扑排序】
- 关于出现错误:_tkinter.TclError: couldn't open "E:\Python系列\Python程序\Python安装.gif"tkinter中不能打开GIF格式图片的解决办法
- 两个栈实现队列 两个队列实现栈
- cogs 738. [网络流24题] 数字梯形
- 489
- ZOJ 3956 Course Selection System(01背包)
- 剪花布条 KMP
- macOS Sierra版本下Hadoop(2.7.3)为分布式环境的详细安装
- POJ 2481 Cows
- java加锁与同步方法
- 2017.4.10 学习记录与感想 (xss、ctf、学习感想)
- MySQL(五)--数据类型
- 还是01串
- http://codeforces.com/problemset/problem/712/C