 |
| ||||
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 | |||||||||
这题,数据设计得太无语了,o(m*n)的复杂度,比o(m*logn)的复杂度还快近一倍这题,数据设计得太无语了,o(m*n)的复杂度,比o(m*logn)的复杂度还快近一倍. 强列建议加上200000 200000 然后1 1 1 ......(200000个1)这组数据 把用类似kmp算法的那些给挂掉! Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
