 |
| ||||
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:谁能解释下这题kmp做的复杂度。。 = =In Reply To:谁能解释下这题kmp做的复杂度。。 = = Posted by:2011339960140 at 2013-10-14 13:57:30 二分长度O(N*L2logL) 后缀匹配O(N*L2) 应该是吧。。。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
