POJ3261 Milk Patterns —— 后缀数组 出现k次且可重叠的最长子串

题目链接：https://vjudge.net/problem/POJ-3261

Milk Patterns

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 17157		Accepted: 7592
Case 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 2
1
2
3
2
3
2
3
1

Sample Output

4

Source

USACO 2006 December Gold

题意：

给出一个字符串（数字串），问至少出现了k次并且可以重叠的最长子串的长度。

题解：

1.POJ1743 Musical Theme此题的加强版。

2.此题要求至少出现了k次，那么相应地在每一组内统计：是否存在一个长度不小于mid（二分时的mid），并且出现了至少k次的公共前缀。

代码如下：

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #include <vector>
 #include <cmath>
 #include <queue>
 #include <stack>
 #include <map>
 #include <string>
 #include <set>
 using namespace std;
 typedef long long LL;
 const double EPS = 1e-;
 const int INF = 2e9;
 const LL LNF = 9e18;
 const int MOD = 1e5;
 const int MAXN = 1e6+;
 
 bool cmp(int *r, int a, int b, int l)
 {
     return r[a]==r[b] && r[a+l]==r[b+l];
 }
 
 int r[MAXN], sa[MAXN], Rank[MAXN], height[MAXN];
 int t1[MAXN], t2[MAXN], c[MAXN];
 void DA(int str[], int sa[], int Rank[], int height[], int n, int m)
 {
     n++;
     int i, j, p, *x = t1, *y = t2;
     for(i = ; i<m; i++) c[i] = ;
     for(i = ; i<n; i++) c[x[i] = str[i]]++;
     for(i = ; i<m; i++) c[i] += c[i-];
     for(i = n-; i>=; i--) sa[--c[x[i]]] = i;
     for(j = ; j<=n; j <<= )
     {
         p = ;
         for(i = n-j; i<n; i++) y[p++] = i;
         for(i = ; i<n; i++) if(sa[i]>=j) y[p++] = sa[i]-j;
 
         for(i = ; i<m; i++) c[i] = ;
         for(i = ; i<n; i++) c[x[y[i]]]++;
         for(i = ; i<m; i++) c[i] += c[i-];
         for(i = n-; i>=; i--) sa[--c[x[y[i]]]] = y[i];
 
         swap(x, y);
         p = ; x[sa[]] = ;
         for(i = ; i<n; i++)
             x[sa[i]] = cmp(y, sa[i-], sa[i], j)?p-:p++;
         if(p>=n) break;
         m = p;
     }
 
     int k = ;
     n--;
     for(i = ; i<=n; i++) Rank[sa[i]] = i;
     for(i = ; i<n; i++)
     {
         if(k) k--;
         j = sa[Rank[i]-];
         while(str[i+k]==str[j+k]) k++;
         height[Rank[i]] = k;
     }
 }
 
 bool test(int mid, int n, int k)
 {
     int cnt = ;
     for(int i = ; i<=n; i++)
     {
         if(height[i]<mid)
             cnt = ;
         else
         {
             cnt++;
             if(cnt==k) return true;
         }
     }
     return false;
 }
 
 int main()
 {
     int n, k;
     while(scanf("%d%d",&n,&k)!=EOF)
     {
         for(int i = ; i<n; i++) scanf("%d", &r[i]);
         r[n] = ;
         DA(r, sa, Rank, height, n, 1e6+);
         int l = , r = n/;
         while(l<=r)
         {
             int mid = (l+r)>>;
             if(test(mid, n, k))
                 l = mid + ;
             else
                 r = mid - ;
         }
         printf("%d\n", r);
     }
 }