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 wyh4104314 at 2008-10-01 18:54:05 on Problem 3661
In Reply To:Re:这个题用什么方法？ Posted by:032989 at 2008-09-18 21:12:20 
dp[i][j]在第i分钟，精力消耗j的情况下最远距离, 并且在第j分钟是running的
也就意味着dp[i-j, .., i][1, ..., j]也是运动的，

所以方程如下：
dp[i][j]=dp[i-1][j-1]+dis[i];
dp[i][0]=max3(dp[i][0], dp[i-1][0], dp[i-j][j]);
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