 |
| ||||
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 | |||||||||
请教各位有什么节约内存，提高效率的办法。由于未看到题目的最后一句话，我用了一种很easy的办法。如下：1。用一个p=11003的hash-table 2。访问一遍过程中输出 时间:O(n),空间O(A) 但如果要排序的话,得O(nlogn) how to advance? Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
