Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
Re:O(n^2)预处理,O(1)查询In Reply To:Re:O(n^2)预处理,O(1)查询 Posted by:117474335 at 2010-10-01 09:31:01 > 单调队列的时间复杂度为O(n),所以搂主是n^2的,没有什么高深的东西。 O(n)的???,,,你也太牛了吧,,,数据读入还是O(n^2)呢,,,, Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator