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

左右各求一次最大子段和并记录每个点的情况O（n），然后扫描一次O（n）

Posted by cyacm at 2008-12-12 20:51:06 on Problem 2479
In Reply To:终于过了，好像可以o（n） Posted by:lyl625760 at 2008-11-17 23:42:03 
初步想法！
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