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:有问题吧。。。O(n^3)复杂度能过?

Posted by 1100012760 at 2012-06-10 19:12:35 on Problem 2549
In Reply To:有问题吧。。。O(n^3)复杂度能过? Posted by:allen4053040allen at 2011-08-12 17:41:38
是啊 我也奇怪o(n3)加二分竟然100msAC了。。。十亿啊。。可能是规模大的数据都是有解的

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