 |
| ||||
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 | |||||||||
请教dynamic nnlogn的算法 你是"在O(nlogn)的时间求出一个序列的长度>=k的平均值最大的子串m"吗In Reply To:没那么简单吧？nlogn的方法都已经有点复杂了... Posted by:dynamic at 2003-11-03 21:02:18 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
