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

KB^2的暴力确实可以过，我优化到了K + n^2 logB，最优是什么复杂度啊，欢迎回信讨论

Posted by blablabla at 2007-06-23 00:30:29 on Problem 2019

Followed by:

我的是K+n^2*lg(n)*lg(n)，你是怎么搞的？是不是2D RMQ有点不适用这题。。 (4) richardxx 2007-07-07 22:34:03
最优应该是O(n^2)吧 (0) Acsaga 2007-08-05 08:25:06
- 哦？？O(n^2)，请问是怎么做的呢？？ (0) richardxx 2007-09-14 18:03:00
  - 懂了，不用理我，我愚笨。。。 (0) richardxx 2007-09-14 18:08:39
用2823 的方法可以 O(N^2+K) (0) swust20064469 2009-09-09 21:29:40

Post your reply here:

Home Page Go Back To top

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