 |
| ||||
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 | |||||||||
Ｏ（ｎ）就是直接线性的扫描一下就可以了…… ZhouY的论文讲的很清楚In Reply To:O(n)不知道怎么弄的?倒是还有另一个O(nlogn)的方法的,正确的 Posted by:ArXoR at 2005-10-26 22:30:35 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
