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:问个白痴问题,sap不是O(n^2m)的吗?这怎么能过?In Reply To:Re:问个白痴问题,sap不是O(n^2m)的吗?这怎么能过? Posted by:0902lwq at 2011-07-18 17:19:55 表示觉得Sap在随机数据中,复杂度更接近n^2... Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator