Hiho 121 后缀数组二·重复旋律2(最长不可重叠重复子串问题)

找最长不可重叠子串，转换成判定问题就是给定一个K，判断是否存在长度为K的不重叠重复子串。K可以通过二分来进行查找，关键是如何判断是否存在长度为K的不可重叠重复子串。具体方法是遍历Height数组，如果有连续的Height值大于等于K，那么它们为一组，对于每一组，我们检查其max(SA)-min(SA)是否大于等于K来判断是否满足要求。

using System;
using System.Collections.Generic;

namespace Hiho
{
    class _121
    {
        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()
        {
            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 bool check(int K)
        {
            int minsa = 10000, maxsa = 0;
            for (int i = 1; i <= n; i++)
            {
                if (Height[i] < K)
                {
                    minsa = SA[i];
                    maxsa = SA[i];
                }
                else
                {
                    minsa = Math.Min(minsa, SA[i]);
                    maxsa = Math.Max(maxsa, SA[i]);
                    if (maxsa - minsa >= K)
                        return true;
                }
            }
            return false;
        }
        static void Main(string[] args)
        {
            string[] lineArray = Console.ReadLine().Split(' ');
            n = int.Parse(lineArray[0]);
            lineArray = Console.ReadLine().Split(' ');
            for (int i = 0; i < n; i++) original[i + 1] = int.Parse(lineArray[i]);
            Suffix();
            int l = 0, r = n - 1, mid = l + (r - l) >> 1, ans = mid;
            while (l <= r)
            {
                mid = l + (r - l) / 2;
                if (check(mid))
                {
                    l = mid + 1;
                    ans = mid;
                }
                else r = mid - 1;
            }
            Console.WriteLine(ans);
        }
    }
}