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

难道非要用O(n)的Suffix Array才可以AC么？

Posted by cryer at 2006-04-27 21:21:56 on Problem 2774
In Reply To:在一般情况下，　这是目前最优了，　您来个常数小的？　好象也不大，　比　nlogn 小多，　如果字符串特别短直接搜就好了，都没必要 SA Posted by:semonteer at 2006-04-25 13:40:30

Followed by:

应该不是,不过貌似O(nlogn)必须写的很牛才可以... (22) RoBa 2006-04-27 22:00:43
- O(nlgn)随便乱写就可以过…… (26) frkstyc 2006-04-27 23:00:19
  - frkstyc大哥不用这么打击人把...我写了几天了..硬是没过啊..... (0) cryer 2006-04-28 01:51:59
  - 这种人就该猛烈kick... -___-b (0) RoBa 2006-04-28 09:54:00
  - n(lgn)^2都能过 (0) zymx 2006-04-28 10:35:26
    - 55555555大家一起打击我...既然这样，楼上大哥能给个能过的n(lgn)^2的程序么？ (0) cryer 2006-04-28 17:13:17
      - 这题数据有无问题，我的aaa aaa都算成1，也AC了？。。。。 (0) MetalHeart 2008-11-21 11:06:55

Post your reply here:

Home Page Go Back To top

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