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

DP

Posted by Gamor at 2010-03-31 22:26:03 on Problem 1471 
dp[i][j] = min(dp[i - 1][j - 1], dp[i - 1][j + 1]) + 1   (map[i][j] && map[i - 1][j] 都是'-'). 注意N的奇偶性。
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