Detail of message

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

trie

Posted by frkstyc at 2005-10-16 23:43:39 on Problem 2564
In Reply To:Re:不要O(nlgn)，O(25000 * 16 * 26)的 Posted by:cuiaoxiang at 2005-10-16 23:39:17

> 你说的是不是就是 hash 表啊？
> 刚才稍微优化了一下，居然就过了，3秒好紧啊。
> 但是我的 hash 表怎么都要1400ms多（我用了vector,可能慢一点）， 看到前面的帖子说可以O(nlogn)
> 不知道1秒内的是不是用这个方法？

Followed by:

Re:trie (37) cuiaoxiang 2005-10-16 23:46:33
- 我感觉是n-ary tree会快 (43) T3 2005-10-16 23:48:37
  - Re:我感觉是n-ary tree会快 (31) cuiaoxiang 2005-10-16 23:51:19

Post your reply here:

Home Page Go Back To top