 |
| ||||
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:O(m*n)In Reply To:O(m*n) Posted by:bjiang at 2008-06-16 11:08:43 > 我的复杂度是O(m*n)，但是要300+ms，可能是实现的问题。没有任何剪枝优化。 我是mnlgn。也要400+。。。好慢啊。哪个大牛能说下m*n算法么 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
