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 zfzgodfather at 2009-09-15 18:50:36 on Problem 2948
In Reply To:这题怎么做？ Posted by:BeStrong at 2006-08-09 18:37:08 
dp( i , j ) = max( dp( i , j-1 ) + effort( i , j , 0 ) , dp( i-1 , j ) + effort( i , j , 1 ) );

每个cell只有上或左两个选择，effort（ int i , int j , int flag )根据flag值计算出列或行的和。
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