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

O(n^2)的dp而已

Posted by gz2001 at 2004-11-08 20:47:18 on Problem 1992
In Reply To:这个题目用什么方法做？我用的时间非常长 Posted by:richardhuang at 2004-11-08 20:30:00

Followed by:

我也是，可是走得好慢 (0) richardhuang 2004-11-08 20:50:16
- 用滚动数组 (0) gz2001 2004-11-08 20:51:11
  - 不会快多少吧，不过节省空间倒是真的 (0) richardhuang 2004-11-08 20:52:50
  - 滚动数组主要是节省空间，对时间复杂度没什么帮助 (0) 10070709 2009-02-09 17:10:15
- 边读边做应该会快些 (0) hust_acm 2004-11-08 20:51:24
  - 对阿，不过当时懒了一开始没写，后来忘记改了 (0) richardhuang 2004-11-08 20:52:28
    - 我开始编的那个还超时呢！！ (0) hust_acm 2004-11-08 20:53:17
      - 你不是过了吗？ (0) richardhuang 2004-11-08 20:53:48
        后来改了才过的 (0) hust_acm 2004-11-08 20:55:09

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