The title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have seem this title.If you haven't ...
分类：
其他好文 时间：
2017-08-24 12:34:37
阅读次数：
177
http://acm.hdu.edu.cn/showproblem.php?pid=2639 ...
分类：
其他好文 时间：
2016-09-28 15:05:59
阅读次数：
156
Bone Collector II Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3437 Accepted Submission(s): 17
分类：
其他好文 时间：
2016-02-13 15:45:58
阅读次数：
191
这个题目是求解第k小01背包， 我们只需要再多加一维表示容量为j时的价值即可。。代码里面用了归并排序的思想来求解f[j][k], 代码如下：#include #include #include using namespace std;int f[1000+10][35];int A[35],...
分类：
其他好文 时间：
2015-11-28 13:33:21
阅读次数：
116
Problem Description
The title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have seem this title.If you haven't seen it before,it doesn't m...
分类：
其他好文 时间：
2015-06-21 09:29:52
阅读次数：
118
Problem Description
The title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must have seem this title.If you haven't seen it before,it doesn't matter,I will give you a link:
Here is the link:http://acm....
分类：
其他好文 时间：
2015-02-11 09:25:32
阅读次数：
206
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2639题意：给出一行价值，一行体积，让你在v体积的范围内找出第k大的值分析：dp[i][j][k]表示前i个物品容积为j时的第k优解。那么对于每种状态dp[i][j]都需要维护好前k优解。 每次根据前k优...
分类：
其他好文 时间：
2014-12-07 01:20:50
阅读次数：
137
