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:发现一个比较强的做法，可以先假设时间，然后用O（n)的复杂度倒推check一下这个这个时间是否合法。

Posted by ylcx at 2005-10-01 10:54:44 on Problem 1967
In Reply To:发现一个比较强的做法，可以先假设时间，然后用O（n)的复杂度倒推check一下这个这个时间是否合法。 Posted by:KOPOPT at 2005-08-12 21:51:52 
...我也想了一下这个方法。。。但是我觉得好像不能2分答案阿。。。。
您是怎么ac的？
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