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

那这题怎么不用单调队列优化呢？

Posted by yygy at 2014-07-11 16:14:02 on Problem 3127
In Reply To:Re:贾兄，你这题的复杂是多少啊？我的是n*n到n*n*n之间，理论是n*n*n的，实际的效果还是挺好的。 Posted by:JiaJunpeng at 2014-07-11 16:07:40 
> 记得是O(N^2)的，你可以做下poj 3722 我用的是类似的方法，可以用单调队列优化到
> O(n)，记得以前YY过。。。。
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