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

pku月赛的一段报告:"如果我们用平衡树来维护这个集合,那么插入、删除与求第 k 小值的复杂度都是 O(logn) 级别的".请教STL,map有求第k小元素的函数?

Posted by cock at 2006-09-04 16:51:02 on Problem 2761


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