POJ 3261 Milk Patterns 【后缀数组 最长可重叠子串】

题目题目：http://poj.org/problem?id=3261

Milk Patterns

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 18880		Accepted: 8336
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

题意概括：

给出一串长度为 N 的字符串

要求找最长可重叠子串，要求至少出现K次；

解题思路：

二分答案长度，按照height分组（按照排序后的后缀，很明显这样才是最优的）

判断条件就是判断是否有一组里面的元素数量 >= K;

AC code:

 #include <set>
 #include <map>
 #include <cmath>
 #include <vector>
 #include <cstdio>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 #define INF 0x3f3f3f3f
 #define LL long long
 using namespace std;
 const int MAXN = 2e5+;
 //const int M = 1e6+10;
 int M;
 int r[MAXN];
 int wa[MAXN], wb[MAXN], wv[MAXN], tmp[MAXN];
 int sa[MAXN]; //index range 1~n value range 0~n-1
 int cmp(int *r, int a, int b, int l)
 {
     return r[a] == r[b] && r[a + l] == r[b + l];
 }

 void da(int *r, int *sa, int n, int m)
 {
     int i, j, p, *x = wa, *y = wb, *ws = tmp;
     for (i = ; i < m; i++) ws[i] = ;
     for (i = ; i < n; i++) ws[x[i] = r[i]]++;
     for (i = ; i < m; i++) ws[i] += ws[i - ];
     for (i = n - ; i >= ; i--) sa[--ws[x[i]]] = i;
     for (j = , p = ; p < n; j *= , m = p)
     {
         for (p = , 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 < n; i++) wv[i] = x[y[i]];
         for (i = ; i < m; i++) ws[i] = ;
         for (i = ; i < n; i++) ws[wv[i]]++;
         for (i = ; i < m; i++) ws[i] += ws[i - ];
         for (i = n - ; i >= ; i--) sa[--ws[wv[i]]] = y[i];
         for (swap(x, y), p = , x[sa[]] = , i = ; i < n; i++)
             x[sa[i]] = cmp(y, sa[i - ], sa[i], j) ? p -  : p++;
     }
 }

 int Rank[MAXN]; //index range 0~n-1 value range 1~n
 int height[MAXN]; //index from 1   (height[1] = 0)
 void calheight(int *r, int *sa, int n)
 {
     int i, j, k = ;
     for (i = ; i <= n; ++i) Rank[sa[i]] = i;
     for (i = ; i < n; height[Rank[i++]] = k)
         for (k ? k-- : , j = sa[Rank[i] - ]; r[i + k] == r[j + k]; ++k);
     return;
 }

 int N, K;
 bool check(int len)
 {
     int cnt = ;
     for(int i = ; i <= N; i++){
         if(height[i] < len) cnt = ;
         else cnt++;
         if(cnt >= K) return true;
     }
     return false;
 }

 int main()
 {
     scanf("%d %d", &N, &K);
     for(int i = ; i < N; i++){
         scanf("%d", &r[i]);
         r[i]++;
         M = max(M, r[i]);
     }
     r[N] = ;
     da(r, sa, N+, M+);
     calheight(r, sa, N);
     int ans = ;
     int L = , R = N, mid;
     while(L <= R){
         mid = (L+R)>>;
         if(check(mid)){
             L = mid+;
             ans = max(mid, ans);
         }
         else R = mid-;
     }
     printf("%d\n", ans);
     return ;
 }