Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:求0MS

Posted by JiaJunpeng at 2014-08-05 00:03:44 on Problem 2968 and last updated at 2014-08-05 00:08:13
In Reply To:Re:求0MS Posted by:yygy at 2014-08-04 23:29:16
> 是不是ri+ri+1<=只要建di,i+1的约束然后最小化sum ,,ri。这样约束会少一些
你这个算法可以尝试一下调参放水,  在你说的N个限制的前提下,随机(或者启发式
更好)增加O(n)级别个 不等式,然后 求sum的最大值

或者在N个限制的前提下搞出最优解,然后check 哪些不等式不满足条件, 然后添加
这些不等式, 继续求最优解,直到所有等式满足为止。。。。

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator