[二分][后缀数组]Milk Patterns POJ3261

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.

Input

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.

Output

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

Sample Input

8 2
1
2
3
2
3
2
3
1

Sample Output

4

题意： 给定长度为n的序列，求出现次数大于等于K的可重叠子串的最大长度。

分析： 由于要求的长度满足二分性质，可以用类似POJ 1743的方法做，先二分出一个长度x，再去判断它是否成立。check的时候也是遍历一遍height数组，记录一下每段height大于x的长度，各段再取最大值就得到该字符串长度为x的可重叠子串出现最大次数，如果这个次数大于等于k就return true，否则return false。

具体代码如下： 

#include <iostream>
#include <cstdio>
using namespace std;
const int maxn = 1e6+10;
int n, m, k;
int s[maxn];
int sa[maxn], height[maxn], x[maxn], y[maxn], rk[maxn], tong[maxn];
void get_sa()
{
    for(int i = 1; i <= n; i++) tong[x[i] = s[i]] ++;
    for(int i = 2; i <= m; i++) tong[i] += tong[i-1];
    for(int i = n; i; i--) sa[tong[x[i]]--] = i;
    for(int k = 1; k <= n; k <<= 1) 
	{
        int num = 0;
        for(int i = n-k+1; i <= n; i++) y[++num] = i;
        for(int i = 1; i <= n; i++) 
		{
            if(sa[i] <= k) continue;
            y[++num] = sa[i] - k;
        }
        for(int i = 0; i <= m; i++) tong[i] = 0;
        for(int i = 1; i <= n; i++) tong[x[i]]++;
        for(int i = 2; i <= m; i++) tong[i] += tong[i-1];
        for(int i = n; i; i--) sa[tong[x[y[i]]]--] = y[i], y[i] = 0;
        swap(x,y);
        x[sa[1]] = 1, num = 1;
        for(int i = 2; i <= n; i++) 
            x[sa[i]] = (y[sa[i]] == y[sa[i-1]] && y[sa[i] + k] == y[sa[i-1] + k]) == 1 ? num : ++ num;
        if(n == num) return;
        m = num;
    }
}

void get_height() 
{
    for(int i = 1; i <= n; i++) rk[sa[i]] = i;
    for(int i = 1, k = 0; i <= n; i++) 
	{
        if(rk[i] == 1) continue;
        if(k) k--;
        int j = sa[rk[i]-1];
        while(i + k <= n && j + k <= n && s[i+k] == s[j+k]) k++;
        height[rk[i]] = k;
    }
}

bool check(int x)
{
	int ans = 0;//记录出现次数 
	int t = 0;
	for(int i = 1; i <= n; i++)
	{
		if(height[i] >= x)
			t++;
		if(height[i] < x || i == n)
		{
			if(t != 0)
				ans = max(ans, t+1);
			t = 0;
		}
	}
	return ans >= k;
}

void solve() 
{
    cin >> n >> k;
    for(int i = 1; i <= n; i++)
    {
    	scanf("%d", &s[i]);
		s[i]++;
	}
    m = 1000005;
    get_sa();
    get_height();
    int l = 1, r = n, ans = -1;
    while(l <= r)
    {
    	int m = l+r>>1;
    	if(check(m))
    	{
    		ans = m;
    		l = m+1;
		}
		else
			r = m-1;
	}
	printf("%d\n", ans);
}

signed main()
{
    solve();
    return 0;
}