Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:非常经典的动态规划,用递归下的记忆化搜索来实现。我将整个实现流程和很多容易错的地方都注释起来，希望能够对那些比较困惑的朋友有所帮助。这程序花了我半个小时调试和写注释，题不在多，经典则行。好晚了，好累，睡觉~~

Posted by DEQDON at 2012-05-01 00:19:08 on Problem 1088
In Reply To:Re:非常经典的动态规划,用递归下的记忆化搜索来实现。我将整个实现流程和很多容易错的地方都注释起来，希望能够对那些比较困惑的朋友有所帮助。这程序花了我半个小时调试和写注释，题不在多，经典则行。好晚了，好累，睡觉~~ Posted by:darku45 at 2011-06-10 03:38:09 
> 我觉得可以，将高度排序，然后最小的那个是1，然后依次递推。。。。d[i][j]=max(周围的四个)，or  d[i][j]=1;
同意
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator