 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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:矩阵k*n^2要3000多MS,有什么更好的算法?矩阵MS无法再优化了,求1S以下算法In Reply To:Re:矩阵k*n^2要3000多MS,有什么更好的算法?矩阵MS无法再优化了,求1S以下算法 Posted by:Shinjikun at 2010-11-28 02:14:48 > 做到O(log(K)*N^2) 进一步做到O(log(K)N*log(N)) Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
