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:2个o(n)的dp,1个o(n)的搜索水过,求教o(n)的算法

Posted by soarwind at 2009-11-11 13:34:27 on Problem 2479
In Reply To:Re:2个o(n)的dp,1个o(n)的搜索水过,求教o(n)的算法 Posted by:250300032 at 2009-10-25 15:32:57
> o(n)的搜索是怎么做到的?
不回溯找连续的几个元素最大和,有o(n)的算法,1050题也用到了

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