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:不知道nlogn的dp是怎么搞的..哪位可否讲解下。

Posted by jackstraw at 2007-05-31 14:29:31 on Problem 1631
In Reply To:不知道nlogn的dp是怎么搞的..哪位可否讲解下。 Posted by:jackstraw at 2007-05-31 14:28:57 
用o(n^2)的dp始终是过不了
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