【学习笔记】后缀数组

LCP Lemma
LCP(i,k)=min(LCP(i,j),LCP(j,k)) 对于任意1<=i<=j<=k<=n)
LCP Theorem
LCP(i,k)=min(LCP(j,j-1)) 对于任意1<=i<j<=k<=n
LCP fucking important
h[i]>=h[i-1]-1

\[\sum_{1\le i<j\le n}LCP(Suf_i,Suf_j)=\sum_{1\le i<j\le n}LCP(Suf_{sa(i)},Suf_{sa(j)}) \]