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
北京大学《ACM/ICPC大学生程序设计竞赛训练》暑期课面向全球招生!

Re:二分—线段树险过 3766 MS O(n(logn^2) )

Posted by yanshen1998 at 2015-05-09 11:39:40 on Problem 2828
In Reply To:二分—线段树险过 3766 MS O(n(logn^2) ) Posted by:hliyuxin at 2012-06-25 13:06:44
不用二分的

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