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 TN at 2005-04-24 16:38:58 on Problem 1923
In Reply To:其实记忆化搜索就是DP Posted by:kicc at 2005-04-24 16:36:27

总觉得DP不需要那个calc[][]数组，而且有的时候代码更短

Followed by:

我是觉得写成搜索的样子比较好写，不用考虑dp的顺序 (75) kicc 2005-04-24 16:43:38
- 说错了，不是1054，是1038 (87) kicc 2005-04-24 16:44:37
  - 为什么会快呢？ (0) TN 2005-04-24 16:45:10
    - 直接DP的话，所有状态都要计算，但是可能有些状态最终是不用的，就是这个原因 (0) kicc 2005-04-24 16:46:38
      - 如果搜索的话应该也是每个状态都要计算的 (37) TN 2005-04-24 16:48:08
- 1054其实是有严格的O(N^2)的算法的 (87) TN 2005-04-24 16:44:42

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