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)？？好夸张，具体点。。。。。。

Posted by lympanda at 2004-11-18 17:12:00 on Problem 2018
In Reply To:ANewStart说。。。。。 Posted by:achilles at 2004-11-18 16:11:01 
> ANewStart说，转化成求最大斜率，然后维护一条往下凸的曲线.(类似凸包)
> O(n)的
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