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

我想了一个n^2的DP,一直都是WA,是算法不对吗?(见内)

Posted by mostleg at 2005-07-29 18:20:42
In Reply To:O(n^2),自己想吧,应该不难想到的 Posted by:xfxyjwf at 2005-07-29 18:08:03
令best[i][j]表示左边从1到i,右边从1到j的最优解。
状态转移就是从best[i][j-1],best[i-1][j]或者是best[a-1][b-1]+2中取最大的(a,b表示从i,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