 |
| ||||
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 | |||||||||
抽象的证明一下In Reply To:怎么也想不通为什么这样是对的 Posted by:kakassi at 2009-10-07 22:00:50 因为next[i]表示的是 以str[next[i]]结尾的最大前缀 lz的条件还少了一个 str[i]==str[next[i]] 这样就能保证当前长串的最后一个字符也跟前缀串的字符相等 如果能够整除的话 表示能够由若干个前缀组成 因为这个next是递归的 很抽象的解释。。。我是这么想的 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
