 |
| ||||
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(p*k)吧. 如果递推可以的话,最后的求和不会成为瓶颈.In Reply To:复杂度还是O(p*k)吧. 如果递推可以的话,最后的求和不会成为瓶颈. Posted by:RoBa at 2006-10-22 20:33:54 恩,明白了. 先存表,再求和. 存表复杂度O(p*k),求和复杂度O(k),所以总复杂度还是O(p*k) Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
