| ||||||||||
| 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 | |||||||||
哪位大牛能给出O(1)算法吗。。。In Reply To:这题重点是算法复杂度,应该没有什么特殊数据,建议您暴力生成数据来验证一下吧 Posted by:liangzhirong at 2008-10-19 20:18:49 > K接近N的时候有些细节还是要考虑清楚的:) Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator