Longest Common Substring（最长公共子串）

SP1811

题目描述
A string is finite sequence of characters over a non-empty finite set Σ.
In this problem, Σ is the set of lowercase letters.
Substring, also called factor, is a consecutive sequence of characters occurrences at least once in a string.
Now your task is simple, for two given strings, find the length of the longest common substring of them.
Here common substring means a substring of two or more strings.
输入格式
The input contains exactly two lines, each line consists of no more than 250000 lowercase letters, representing a string.
输出格式
The length of the longest common substring. If such string doesn’t exist, print “0” instead.
题意翻译
输入2 个长度不大于250000的字符串，输出这2 个字符串的最长公共子串。如果没有公共子串则输出0 。
Translated by @xyz32768
输入输出样例
输入
alsdfkjfjkdsal
fdjskalajfkdsla
输出
3

有两个字符串$A$和$B$，我们要求它们的最长公共连续子串。
首先，我们对$A$建立一个$SAM$。
定义：$Len$为当前$B$的前$i$个字符组成的子串与$A$的最长公共子序列，$State$为当前状态，初始化为0（初始状态）。$next(State,ch)$为在$State$状态节点处往$ch$道路走的下一状态。
匹配：
然后我们从$B[i=0]$开始，在$A$的$SAM$上走，一个一个匹配，若：

1. 当前状态朝着 B [ i ] B[i]