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

不好，不是KMP

Posted by RoBa at 2006-12-08 21:00:45 on Problem 3080
In Reply To:不知道这个strstr()的复杂度是多少呢? Posted by:jianchenhao at 2006-12-08 20:51:55

Followed by:

KMP其实平均不好 (0) frkstyc 2006-12-08 21:10:00
- 弱弱地问一下,除了KMP和朴素的算法还有别的什么来判断是否为一个子串么? (0) jianchenhao 2006-12-08 21:25:26
  - 后缀数组....后缀树..... (0) wywcgs 2006-12-08 21:41:37
    - sigh~~~目前只会写O(k*N^2)的后缀数组 (0) goodhorsezxj 2006-12-09 21:00:50
      - k是什么 n是什么? (0) sunmoonstar 2006-12-09 21:05:21
      - 那个O(n)的论文讲得貌似挺浅显易懂的…… (0) wywcgs 2006-12-09 21:28:01
        但是O(n)rmq pk O(nlogn)rmq 在n<100w的时候几乎没有优势 (0) sunmoonstar 2006-12-09 21:32:18
        那就O(nlgn)rmq - - (0) wywcgs 2006-12-09 21:33:47
        O(n)的没写过... (0) ArXoR 2006-12-09 21:43:33
        写了,效果不好,空间复杂度也不小 (0) sunmoonstar 2006-12-10 00:19:12

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