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

我对您的double不感兴趣，对O(n)很感兴趣。能说一下吗？

Posted by tengshengbo at 2005-08-12 22:43:38 on Problem 2559
In Reply To:我 O(2*n) 的方法在ZJU 0.25s 上过了,这里TLE啊! Posted by:duck904 at 2005-08-12 20:56:58

Followed by:

去ulm local的网站看看吧，说了好多种算法 (0) frkstyc 2005-08-12 22:44:31
- ulm local 地址? (0) duck904 2005-08-12 22:46:56
- 多谢。我还真没去过那儿。一直很向往：） (0) tengshengbo 2005-08-12 22:48:10
  - "向往"…… (0) frkstyc 2005-08-12 22:48:33
  - 这个纯搞笑 (0) sunmoonstar_love 2005-08-12 22:51:29
您的O(n)怎么那么慢？我保存了每个数前面、后面第一个比他小的，用dp,两层循环（里面那个肯定很快）。100ms左右. (0) tengshengbo 2005-08-12 22:47:23
- 我是用堆栈存起来的,所以慢,还是你的方法好,记下位置就好了 (0) duck904 2005-08-12 22:49:12

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