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

感觉我的算法是 nlogn 的, 我用 RMQ+二分,怎么会如此的TLE呢,难道有特殊数据吗

Posted by xiaox at 2007-03-02 13:51:46 on Problem 2796

Followed by:

没试过O(nlgn)，这道题可以O(n)搞定 (0) wywcgs 2007-03-02 14:39:00
- G++过，C++超时。。 (0) Acsaga 2007-03-06 00:03:03
用O(n^2)混过去了。。 (0) Acsaga 2007-03-05 23:51:46
- 用O(n^2)也能过？ (0) dongshanluo 2007-09-25 17:33:24
  - Re:用O(n^2)也能过？ (32) 1606880712 2015-08-13 19:18:43
    - Re:用O(n^2)也能过？ (59) 1606880712 2015-08-13 19:19:06

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