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

调过了样例就交了，看来算法对很重要，不过，我的巨慢无比

Posted by patina at 2005-07-18 20:22:55 on Problem 2489
In Reply To:嗯, 而且一次就AC Posted by:c0500448242 at 2005-07-18 19:56:29

Followed by:

能在时限内出来就可以了，TUD比赛的时候这个题限90秒 (0) frkstyc 2005-07-18 20:25:47
- 但是我很想知道别人怎么<1000ms的，:) (0) patina 2005-07-18 20:27:16
  - 我也想知道 (0) c0500448242 2005-07-18 20:33:55
    - 呵呵，好好想想吧，想办法把O(nlogn)-O(nlogn)搞成O(nlogn)-O(n)就行了 (0) frkstyc 2005-07-18 20:42:41
      - 斜率相同的那些线段覆盖大概也许似乎的确可以做到O(n)??那就不能排序了....怎么搞呢？ (0) palmtenor 2005-07-18 20:47:05
        我说的同组统计的时间，分组还是要O(nlogn)的 (0) frkstyc 2005-07-18 20:48:11

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