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

N^3的算法差不多能卡着过，可是为什么有些人更快？还有更快的算法吗？

Posted by achilles at 2004-10-31 23:27:16 on Problem 1964

Followed by:

N^3能过吗？1000^3=10^9，太夸张了 (0) xiaomi 2004-10-31 23:36:56
- King of Optimizing (0) xiaomi 2004-10-31 23:38:41
- achilles 1964 Accepted 3952K 2984MS C++(GCC) 0.99K 2004-10-31 23:19:38 (0) achilles 2004-10-31 23:39:09
  - Re: achilles 1964 Accepted 3952K 2984MS C++(GCC) 0.99K 2004-10-31 23:19:38 (11) uni 2004-11-01 14:26:35
    - N^2怎么做? (1) xinwenxin 2004-11-01 16:55:37
      - 我的应该算O(N^2)吧,二维降为一维,不过这过程只需从第一行开始,不需再从第二,三行开始了,所以时间就从O(N^3)降到O(N^2)了 (5) windbells 2004-11-03 14:10:47
        我用的是求最大矩形和的办法，所以N^3，你的方法为什么不需要从第二，三····开始？？ (0) HUT 2004-11-03 16:59:32
        果然是 N^2，恩，爽~ (1) 00448247 2011-06-26 18:43:29
      - 终于明白怎么做了～～ (199) achilles 2004-11-04 16:12:06
        线性算法是怎么来的？我只能想到RMQ.. (221) yiyiyi4321 2007-06-06 14:48:12
        谢谢啦～～～ (0) alpc55 2008-05-23 20:50:42
    - Re: achilles 1964 Accepted 3952K 2984MS C++(GCC) 0.99K 2004-10-31 23:19:38 (15) ACM29350 2004-11-03 16:57:29

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