POJ Milk Patterns (后缀数组）

Milk Patterns

Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 12383 Accepted: 5486Case Time Limit: 2000MS

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.

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 212323231

Sample Output

4

#include <iostream>#include <cstring>#include <cstdlib>#include <cstdio>#include <cmath>#include <queue>#include <map>#include <algorithm>#define LL long long using namespace std;const int MAXN = 20000 + 10;int n, k, p;int rank[MAXN], tmp[MAXN];bool compare_sa(int i, int j){    if(rank[i] != rank[j]) return rank[i] < rank[j];    else    {        int ri = i + p <= n ? rank[i + p] : -1;        int rj = j + p <= n ? rank[j + p] : -1;        return ri < rj;    }}void construct_sa(int *r, int *sa){    for(int i=0;i<=n;i++)    {        sa[i] = i;        rank[i] = i < n ? r[i] : -1;    }    for(p=1;p<=n;p*=2)    {        sort(sa, sa + 1 + n, compare_sa);        tmp[sa[0]] = 0;        for(int i=1;i<=n;i++)        {            tmp[sa[i]] = tmp[sa[i-1]] + (compare_sa(sa[i-1], sa[i]) ? 1 : 0);        }        for(int i=0;i<=n;i++)             rank[i] = tmp[i];    }}void construct_lcp(int * r, int *sa, int *lcp){    for(int i=0;i<=n;i++) rank[sa[i]] = i;    int h = 0; lcp[0] = 0;    for(int i=0;i<n;i++)    {        int j = sa[rank[i] - 1];        if(h > 0) h--;        for(;j+h<n&&i+h<n;h++)        {            if(r[j + h] != r[i + h]) break;        }        lcp[rank[i] - 1] = h;    }}int A[MAXN], sa[MAXN];int lcp[MAXN];bool check(int len){int cnt = 1;for(int i=1;i<=n;i++){if(lcp[i] >= len) ++cnt;else cnt = 1;if(cnt >= k) return true;}return false;}int main(){    while(scanf("%d%d", &n, &k)!=EOF)    {        memset(sa, 0, sizeof(sa));        for(int i=0;i<n;i++)        {            scanf("%d", &A[i]);        }        construct_sa(A, sa);        construct_lcp(A, sa, lcp); //       for(int i=0;i<=n;i++) cout << lcp[i] << ' ';    //        cout << endl;        int l = 1, r = n, ans;        while(l <= r)        {        int mid = (l + r) >> 1;        if(check(mid))        {        l = mid + 1;        ans = mid;        }        else r = mid - 1;        }        cout << ans << endl;    }    return 0;}