ZOJ
来源:互联网 发布:闲鱼淘宝介入操作过程 编辑:程序博客网 时间:2024/06/15 14:05
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3956点击打开链接
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.
#include <iostream>#include <algorithm>#include <cstring>#include <vector>#include <stdio.h>#define maxn 2005using namespace std;struct xjy{ long long int h; long long int c;};vector<xjy > s;int main(){ int t; scanf("%d",&t); while(t--) { long long int m;long long int sum=0; long long int dp[55555]; memset(dp,0,sizeof(dp)); s.clear(); scanf("%lld",&m); for(int i=1;i<=m;i++) { xjy mid; scanf("%lld%lld",&mid.h,&mid.c); s.push_back(mid); sum+=mid.c; } for(int i=0;i<m;i++) { for(int j=sum;j>=s[i].c;j--) dp[j]=max(dp[j],dp[j-s[i].c]+s[i].h); } long long int ans=0; for(int i=1;i<=sum;i++) ans=max(ans,dp[i]*dp[i]-dp[i]*i-i*i); printf("%lld\n",ans); }}
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- 定时器Timer
- JDB调试Android程序(通过JDB进行代码注入)
- JDK JRE SDK NDK IDE ADT ANT Eclipse AndroidStudio 环境及资源
- SDUT 2556 传说中的数据结构
- MAC上给Mac上给iTerm2中的vim上点颜色
- ZOJ
- 类的操作符重载及友元函数
- 9.5 条件概率
- springmvc中@ModelAttribute和@SessionAttributes标签的使用
- 图说设计模式
- itext5关于页眉和页脚的设置
- web17天过滤器,监听器
- deeplearning.ai学习(numpy方法使用)
- (一)Spark本地开发环境搭建与远程debug设置