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.

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.

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

8 2

1

2

3

2

3

2

3

1

4

 #include <iostream>

 #include <set>

 #include <cmath>

 #include <stdio.h>

 #include <cstring>

 #include <algorithm>

 #include <vector>

 #include <queue>

 #include <map>

 using namespace std;

 typedef long long LL;

 #define inf 0x7f7f7f7f

 const int maxn = 1e6 + ;

 int n, k;

 char str[maxn];

 int sa[maxn];

 int t1[maxn], t2[maxn], c[maxn];

 LL rnk[maxn], height[maxn];

 int cnt[maxn];

 void build_sa(int s[], int n, int m)

 {

     int i, j, p, *x = t1, *y = t2;

     for(i = ; i < m; i++)c[i] = ;

     for(i = ; i < n; i++)c[x[i] = s[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]] = y[sa[i - ]] == y[sa[i]] && y[sa[i - ] + j] == y[sa[i] + j] ? p - :p++;

         if(p >= n)break;

         m = p;

     }

 }

 void get_height(int s[], int n)

 {

     int i, j, k = ;

     //cout<<"SA:"<<endl;

     for(i = ; i <= n; i++){

         //cout<<sa[i]<<endl;

         rnk[sa[i]] = i;

     }

     for(i = ; i < n; i++){

         if(k) k--;

         j = sa[rnk[i] - ];

         while(s[i + k] == s[j + k])k++;

         height[rnk[i]] = k;

     }

 }

 bool check(int t)

 {

     int num = ;

     for(int i = ; i <= n; i++){

         if(height[i] >= t){

             num++;

             if(num >= k)return true;

         }

         else num = ;

     }

     return false;

 }

 int s[maxn];

 int main()

 {

     while(scanf("%d%d", &n, &k) != EOF){

         //scanf("%s", str);

         int m = -inf;

         for(int i = ; i < n; i++){

             scanf("%d", &s[i]);

             m = max(m, s[i]);

             cnt[i] = ;

         }

         s[n] = cnt[n] = ;

         build_sa(s, n + , m + );

         //cout<<1<<endl;

         get_height(s, n);

         //cout<<2<<endl;

         int st = , ed = n, ans;

         while(st <= ed){

             int mid = (st + ed) / ;

             if(check(mid)){

                 st = mid + ;

                 ans = mid;

             }

             else{

                 ed = mid - ;

             }

         }

         printf("%d\n", ans);

     }

     return ;

 }