luogu P2852 [USACO06DEC]牛奶模式Milk Patterns 后缀数组 + Height数组 + 二分答案 + 扫描

题目描述

Farmer John has noticed that the quality of milk given by his cows varies from day to day. On further investigation, he discovered that although he can't predict the quality of milk from one day to the next, there are some regular patterns in the daily milk quality.

To perform a rigorous study, he has invented a complex classification scheme by which each milk sample is recorded as an integer between 0 and 1,000,000 inclusive, and has recorded data from a single cow over N (1 ≤ N ≤ 20,000) days. He wishes to find the longest pattern of samples which repeats identically at least K (2 ≤ K ≤ N) times. This may include overlapping patterns -- 1 2 3 2 3 2 3 1 repeats 2 3 2 3 twice, for example.

Help Farmer John by finding the longest repeating subsequence in the sequence of samples. It is guaranteed that at least one subsequence is repeated at least K times.

农夫John发现他的奶牛产奶的质量一直在变动。经过细致的调查，他发现：虽然他不能预见明天产奶的质量，但连续的若干天的质量有很多重叠。我们称之为一个“模式”。 John的牛奶按质量可以被赋予一个0到1000000之间的数。并且John记录了N(1<=N<=20000)天的牛奶质量值。他想知道最长的出现了至少K(2<=K<=N)次的模式的长度。比如1 2 3 2 3 2 3 1 中 2 3 2 3出现了两次。当K=2时，这个长度为4。

输入输出格式

输入格式：

Line 1: Two space-separated integers: N and K

Lines 2..N+1: N integers, one per line, the quality of the milk on day i appears on the ith line.

输出格式：

Line 1: One integer, the length of the longest pattern which occurs at least K times

题解：二分答案出最长长度，利用 $Height$ 数组完成判断.
如果当前长度时合法的，说明有一段连续区间的 $Height$ 值都是要大于等于二分出来的答案的.

#include <bits/stdc++.h>
#define setIO(s) freopen(s".in", "r", stdin)
#define maxn 100000
using namespace std;
int n, m, tot;
int arr[maxn], height[maxn], A[maxn];
namespace SA
{
    int rk[maxn], tp[maxn], sa[maxn], tax[maxn];
    void qsort()
    {
        for(int i = 0; i <= m ; ++i) tax[i] = 0;
        for(int i = 1; i <= n ; ++i) ++tax[rk[i]];
        for(int i = 1; i <= m ; ++i) tax[i] += tax[i - 1];
        for(int i = n; i >= 1 ; --i) sa[tax[rk[tp[i]]]--] = tp[i];
    }
    void build()
    {
        for(int i = 1; i <= n ; ++i) rk[i] = arr[i], tp[i] = i;
        qsort();
        for(int k = 1; k <= n ; k <<= 1)
        {
            int p = 0;
            for(int i = n - k + 1; i <= n ; ++i) tp[++p] = i;
            for(int i = 1; i <= n ; ++i) if(sa[i] > k) tp[++p] = sa[i] - k;
            qsort(), swap(rk, tp), rk[sa[1]] = p = 1;
            for(int i = 2; i <= n ; ++i)
            {
                rk[sa[i]] = (tp[sa[i - 1]] == tp[sa[i]] && tp[sa[i - 1] + k] == tp[sa[i] + k]) ? p : ++p;
            }
            if(n == p) break;
            m = p;
        }
        int k = 0;
        for(int i = 1; i <= n ; ++i) rk[sa[i]] = i;
        for(int i = 1; i <= n ; ++i)
        {
            if(k) --k;
            int j = sa[rk[i] - 1];
            while(arr[i + k] == arr[j + k]) ++k;
            height[rk[i]] = k;
        }
    }
};
bool check(int t)
{
    int o = 0;
    for(int i = 1; i <= n ; ++i)
    {
        if(height[i] < t) o = 0;
        if(++o >= tot) return true;
    }
    return false;
}
int main()
{
    // setIO("input");
    scanf("%d%d",&n,&tot);
    for(int i = 1; i <= n ; ++i) scanf("%d",&arr[i]), A[i] = arr[i];
    sort(A + 1, A + 1 + n);
    for(int i = 1; i <= n ; ++i) arr[i] = lower_bound(A + 1, A + 1 + n, arr[i]) - A, m = max(m, arr[i]);
    SA::build();
    int l = 1, r = n, mid, ans = 0;
    while(l <= r)
    {
        mid = (l + r) >> 1;
        if(check(mid))
            ans = mid, l = mid + 1;
        else
            r = mid - 1;
    }
    printf("%d\n", ans);
    return 0;
}