 |
| ||||
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 | |||||||||
没那么简单吧？nlogn的方法都已经有点复杂了...In Reply To:我也是这么做的："O(n)的时间求出一个序列的长度>=k的平均值最大的子串" 原理和To the max一样，你再测测对不对吧 Posted by:rruucc at 2003-11-03 19:46:21 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
