後綴自動機專題

http://www.javashuo.com/article/p-hjswsqxq-db.html SPOJ Longest Common Substring 求兩串的最長公共子串 #include<bits/stdc++.h> using namespace std; const int MAX=2e6; const int INF=0x3f3f3f3f; struct Tire {

>>阅读原文<<