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 |
rruucc发一份给他吧,让他研究一下如何:)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