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

原来直接对k排序把a看成关键字线性建cartesian tree就可以了

Posted by frkstyc at 2005-04-19 18:21:07 on Problem 2201
In Reply To:Re:这个是不能直接做treap过程的么？ Posted by:frkstyc at 2005-04-19 16:17:45 
> 知道了，key==aux的时候会退化成n^2，ft
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