Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

Re:O(nlogn)的算法，看了讨论没有这么做的？250ms

Posted by 768059009 at 2017-03-28 19:26:44 on Problem 1701
In Reply To:O(nlogn)的算法，看了讨论没有这么做的？250ms Posted by:KatrineYang at 2017-03-27 13:03:06

> RT，就是因为目标函数是凸函数，所以电梯停靠在1~M的钚满意度的值组成的序列是双调序列，二分求极值~~
目标函数是Ci = ∑_(j=1)^(i-1)▒〖[(b(i-j)*k_(j )+ k_j*1/2*(i-j)(i-j-1)〗]
             + ∑_(j=i+1)^m▒〖[a(j-i)*k_(j )+ k_(j )*1/2*(j-i)(j-i-1)]〗吗？
您是怎么看出来是凸函数的呢？Orz

Followed by:

Post your reply here:

Home Page Go Back To top