数算实习 Long Long Message 后缀数组

Long Long Message
求两个字符串的最大公共子串

样例输入
yeshowmuchiloveyoumydearmotherreallyicannotbelieveit
yeaphowmuchiloveyoumydearmother

样例输出
27

 #include <iostream>
 #include <algorithm>
 #include <string>
 #include <cstring>
 #include <deque> 
 using namespace std; 
 
 const int MAXN = 810000;
 string all;
 int sa[MAXN];             //sa[i]表示位次为i的后缀的位置
 int height[MAXN];         //height[i]表示位次为i的后缀与位次为i-1的后缀的最长公共前缀
 int ra[MAXN];
 int wa[MAXN], wb[MAXN], wv[MAXN], Ws[MAXN]; 
 
 void BuildSA(string s, int sa[], int n, int m)
 {
  int i, j, p, *pm = wa, *k2sa = wb, *t;
  for (i = 0; i < m; i++)
   Ws[i] = 0;
  for (i = 0; i < n; i++)
   Ws[pm[i] = s[i]]++;
  for (i = 1; i < m; i++)
   Ws[i] += Ws[i - 1];
  for (i = n - 1; i >= 0; i--)
   sa[--Ws[pm[i]]] = i;
  for (j = p = 1; p < n; j <<= 1, m = p)
  {
   for (p = 0, i = n - j; i < n; i++)
    k2sa[p++] = i;
   for (i = 0; i < n; i++)
    if (sa[i] >= j)
     k2sa[p++] = sa[i] - j;
   for (i = 0; i < m; i++)
    Ws[i] = 0;
   for (i = 0; i < n; i++)
    Ws[wv[i] = pm[k2sa[i]]]++;
   for (i = 1; i < m; i++)
    Ws[i] += Ws[i - 1];
   for (i = n - 1; i >= 0; i--)
    sa[--Ws[wv[i]]] = k2sa[i];
   for (t = pm, pm = k2sa, k2sa = t, pm[sa[0]] = 0, p = i = 1; i < n; i++)
   {
    int a = sa[i - 1], b = sa[i];
    if (k2sa[a] == k2sa[b] && k2sa[a + j] == k2sa[b + j])
     pm[sa[i]] = p - 1;
    else
     pm[sa[i]] = p++;
   }
  }
  return;
 }
 void BuildHeight(string str, int n, int* sa, int* Rank)
 {
  int i, j, k;
  for (int i = 0; i < n; ++i)
   Rank[sa[i]] = i;
  for (i = k = 0; i < n; height[Rank[i++]] = k)
   for (k ? k-- : 0, j = sa[Rank[i] - 1]; str[i + k] == str[j + k]; k++);
 }
 
 int main()
 {
  string c;
  cin >> c;
  all = c;
  int mid = all.size();
  char p = 'z' + 1;
  all += p;
  cin >> c;
  all += c;
  all += '\0';
  int l = all.size();
  BuildSA(all, sa, l, 127);
  BuildHeight(all, l, sa, ra);
  int m = 0;
  for (int i = 1; i < l; i++)
  {
   if ((sa[i]<mid&&sa[i - 1]>mid) || (sa[i] > mid&&sa[i - 1] < mid))
    m = max(m, height[i]);
  }
  cout << m << endl;

  return 0;
 }