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 |
AC的有点迷糊为什么直接扫描height数组一遍,找到最大的height(i)并且限定两个后缀suffix(sa[i]}和suffix(sa[i-1])不在同一个字符串就过了?而不要用rmq查找最长公共前缀? Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator