ZOJ 3956 Course Selection System(01背包变形)
来源:互联网 发布:淘宝多少等级可以直播 编辑:程序博客网 时间:2024/06/06 13:12
There are n courses in the course selection system of Marjar University. Thei-th course is described by two values: happiness Hi and creditCi. If a student selectsm 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 andCi (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.
【题意】每门课有一个H值和C值,学生选课的满意值=ΣH^2-ΣH*ΣC-ΣC^2。求学生选课的最大满意值。
【分析】满意值=ΣH(ΣH-ΣC)-ΣC^2,可见当C一定时,H越大,满意值越高。因此转化为C作为容量的01背包来求解。
#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>using namespace std;#define maxn 505int N,sum;int h[maxn],c[maxn];long long ans,dp[50005];int main(){ int T; scanf("%d",&T); while(T--){ scanf("%d",&N); sum=0;ans=0; memset(dp,0,sizeof(dp)); for(int i=0;i<N;i++){ scanf("%d%d",&h[i],&c[i]); sum+=c[i]; } for(int i=0;i<N;i++){ for(int j=sum;j>=c[i];j--){ if(dp[j]<=dp[j-c[i]]+h[i]){ dp[j]=dp[j-c[i]]+h[i]; ans=max(ans,dp[j]*dp[j]-dp[j]*j-j*j); } } } 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,01背包!
- ZOJ-3956 Course Selection System(01背包)
- zoj 3956-Course Selection System(背包)
- 浙大17年校赛(ZOJ 3956)Course Selection System[01背包]
- ZOJ 3956 Course Selection System(01背包)
- Zoj 3956 Course Selection System (01背包)
- ZOJ 3956 Course Selection System (dp 01背包)
- 浙大校赛 ZOJ 3956Course Selection System (01背包)
- ZOJ 3956 Course Selection System 【 思维 + 01背包 】
- zoj 3596Course Selection System(dp,01背包)
- ZOJ 3956 Course Selection System
- ZOJ 3956 Course Selection System
- zoj 3956 Course Selection System
- Python输入不定行
- 手撕代码(四):堆排序
- python2.7 mysql.connector的安装
- BZOJ 3238 差异
- 循环语句分析
- ZOJ 3956 Course Selection System(01背包变形)
- 数字图像处理成长之路10:理解直方图均衡化,从现象到原理
- JNA实战笔记汇总<二> JNA和C/C++的数据类型转换
- Freemarker科学计数法问题
- UVa 10369
- J2EE进阶之上传和下载 二十二
- 对一个int数组按照从大到小进行排序,最快实现方法
- Vue移动端坑点
- 面向对象——类的成员之方法