POJ 3261 Milk Patterns

Description
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.

---

【题目分析】
同样是二分答案，然后把不小于len的后缀分成一组，看看个数是否超过了k个，如果超过，证明答案可行，时间复杂度nlogn

---

【代码】

#include <cstring>
#include <cstdio>
#define maxn 20001
#define m(a) memset(a,0,sizeof a)
int len,wa[maxn],wb[maxn],wv[maxn],ws[maxn],sa[maxn],rank[maxn],height[maxn],s[maxn],n,a[maxn];
inline int cmp(int *r,int a,int b,int l)
{return r[a]==r[b]&&r[a+l]==r[b+l];}
inline void getsa(int *r,int *sa,int n,int m)
{
    int i,j,p,*x=wa,*y=wb,*t;
    for (i=0;i<m;++i) ws[i]=0;
    for (i=0;i<n;++i) ws[x[i]=r[i]]++;
    for (i=1;i<m;++i) ws[i]+=ws[i-1];
    for (i=n-1;i>=0;--i) sa[--ws[x[i]]]=i;
    for (j=1,p=1;p<n;j*=2,m=p)
    {
        for (p=0,i=n-j;i<n;++i) y[p++]=i;
        for (i=0;i<n;++i) if (sa[i]>=j) y[p++]=sa[i]-j;
        for (i=0;i<n;++i) wv[i]=x[y[i]];
        for (i=0;i<m;++i) ws[i]=0;
        for (i=0;i<n;++i) ws[wv[i]]++;
        for (i=1;i<m;++i) ws[i]+=ws[i-1];
        for (i=n-1;i>=0;--i) sa[--ws[wv[i]]]=y[i];
        for (t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1;i<n;++i)
        x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++;
    }
}
inline void gethi(int *r,int n)
{
    int i,j,k=0;
    for (i=1;i<=n;++i) rank[sa[i]]=i;
    for (i=0;i<n;height[rank[i++]]=k)
        for (k?k--:0,j=sa[rank[i]-1];r[i+k]==r[j+k];k++);
}
inline bool test(int k)
{
    int i=2;
    while (i<=n)
    {
        if (height[i]>=k)
        {
            int tot=2;
            while (height[i+1]>=k) ++i,++tot;
            if (tot>=len) return true;
        }
        i++;
    }
    return false;
}
int main()
{
    while (scanf("%d%d",&n,&len)==2)
    {
        for (int i=0;i<n;++i) scanf("%d",&s[i]);
        s[n]=0;
        getsa(s,sa,n+1,200);
        gethi(s,n);
        int l=0,r=n;
        while (l<r)
        {
            int mid=(l+r+1)/2;
            if (test(mid)) l=mid;
            else r=mid-1;
        }
        printf("%d\n",l);
    }
}