Hiho 122 后缀数组三·重复旋律3(多个串的最长公共重复子串)

using System;

namespace Hiho
{
    class _122
    {
        static readonly int MAXN = 1000050;
        static char[] ch = new char[MAXN], All = new char[MAXN];
        static int[] SA = new int[MAXN], rank = new int[MAXN], Height = new int[MAXN], tax = new int[MAXN], tp = new int[MAXN], original = new int[MAXN];
        static int n, m;
        static void RSort()
        {
            for (int i = 0; i <= m; i++) tax[i] = 0;
            for (int i = 1; i <= n; i++) tax[rank[tp[i]]]++;
            for (int i = 1; i <= m; i++) tax[i] += tax[i - 1];
            for (int i = n; i >= 1; i--) SA[tax[rank[tp[i]]]--] = tp[i];
        }
        static bool cmp(int[] f, int x, int y, int w) { return f[x] == f[y] && f[x + w] == f[y + w]; }
        static void Suffix()
        {
            //SA
            for (int i = 1; i <= n; i++)
            {
                rank[i] = original[i];
                tp[i] = i;
            }
            m = 2000; RSort();
            for (int w = 1, p = 1, i; p < n; w += w, m = p)
            {
                for (p = 0, i = n - w + 1; i <= n; i++) tp[++p] = i;
                for (i = 1; i <= n; i++) if (SA[i] > w) tp[++p] = SA[i] - w;
                RSort();
                int[] temp = rank;
                rank = tp;
                tp = temp;
                rank[SA[1]] = p = 1;
                for (i = 2; i <= n; i++) rank[SA[i]] = cmp(tp, SA[i], SA[i - 1], w) ? p : ++p;
            }
            int j, k = 0;
            for (int i = 1; i <= n; Height[rank[i++]] = k)
                for (k = k != 0 ? k - 1 : k, j = SA[rank[i] - 1]; original[i + k] == original[j + k]; ++k) ;
        }
        static void Main(string[] args)
        {
            string str = Console.ReadLine();
            int index = str.Length;
            str += "$" + Console.ReadLine();
            n = str.Length;
            for (int i = 0; i < n; i++) original[i + 1] = str[i];
            Suffix();
            int ans = 0;
            for (int i = 1; i < n; ++i)
                if (Height[i] > ans && ((SA[i] > index && SA[i - 1] < index) || (SA[i] < index && SA[i - 1] > index)))
                    ans = Height[i];
            Console.WriteLine(ans);
        }
    }
}