Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

rruucc发一份给他吧,让他研究一下如何:)

Posted by hawking at 2003-11-03 22:06:34 on Problem 1387
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:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator