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

Re:如果m-1个人都只有一个共同的boss,你那样每次往前扫的时间复杂度不是O(m^2)的吗?

Posted by qrmajia at 2009-11-11 20:51:59 on Problem 1634 and last updated at 2009-11-11 20:52:22
In Reply To:闲来无事发份解题报告 Posted by:foreverlin at 2009-02-11 20:51:47
 

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