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[i][j] = max(dp[i-1][j], dp[i+1][j], dp[i][j-1], dp[i][j+1]) + 1

Posted by ds570 at 2017-04-06 20:45:49 on Problem 1088 
状态转移方程不应该是
dp[i][j] = max(dp[i-1][j]+dist[i][j]-dist[i-1][j], dp[i+1][j]+dist[i][j]-dist[i+1][j], dp[i][j-1]+dist[i][j]-dist[i][j-1], dp[i][j+1]+dist[i][j]-dist[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