[SPOJ1812]LCS2 - Longest Common Substring II

LCS2 - Longest Common Substring II

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 a bit harder, for some given strings, find the length of the longest common substring of them.
Here common substring means a substring of two or more strings.
Input
The input contains at most 10 lines, each line consists of no more than 100000 lowercase letters, representing a string.
Output
The length of the longest common substring. If such string doesn’t exist, print “0” instead.
Example
Input:
alsdfkjfjkdsal
fdjskalajfkdsla
aaaajfaaaa
Output:
2

Solution
把一个串建成自动机，其它的在上面跑，统计出每个串在每个状态的最大匹配长度，每个状态取所有串的最小值得到所有串在该状态的最大匹配长度，最后扫描所有状态取最大值得到结果

Code

#include <bits/stdc++.h>
using namespace std;

#define rep(i, l, r) for (int i =