01分数规划
mengxiang000000
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #277.5(Div. 2)E. Hiking【Dp+01分数规划】
E. Hikingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA traveler is planning a water hike along the river. He note原创 2017-04-20 15:28:30 · 492 阅读 · 0 评论 -
Poj 2976 Dropping tests【01分数规划+贪心】
Dropping testsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11942 Accepted: 4169DescriptionIn a certain course, you take n tests. If you get ai out原创 2017-04-20 20:08:49 · 510 阅读 · 0 评论 -
Poj 2728 Desert King【最优比例生成树/01分数规划】
Desert KingTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 25612 Accepted: 7110DescriptionDavid the Great has just become the king of a desert country原创 2017-04-22 19:16:41 · 403 阅读 · 0 评论 -
Hdu 6070 Dirt Ratio【分数规划+二分+线段树】好题~好题~
Dirt RatioTime Limit: 18000/9000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1515 Accepted Submission(s): 698Special JudgeProblem Description原创 2017-08-05 15:15:12 · 655 阅读 · 0 评论 -
UvaLive 7037 The Problem Needs 3D Arrays 【最大密度子图-最大权闭合子图做法】
题目大意:现在让我们求一个子序列(逆序数/子序列长度)的最大值。思路:经典的最大密度子图问题①首先用到01分数规划。因为要求X/Y的最大值,那么我们可以定义:F(Mid)=X-Mid*Y如果有F(MID)>=0,那么就有:X-mid*Y>=0,那么就有X/Y>=Mid那么观察到问题具有单调性,那么Mid的值,我们二分处理即可。原创 2017-10-05 15:21:11 · 439 阅读 · 0 评论