【后缀数组】 POJ Milk Patterns

二分+后缀数组分组，和前几题类似，一样的。。

#include <iostream>  
#include <sstream>  
#include <algorithm>  
#include <vector>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <cstring>  
#include <cstdlib>  
#include <cmath>  
#include <climits>  
#define maxn 1000005
#define eps 1e-6 
#define mod 10007 
#define INF 99999999  
#define lowbit(x) (x&(-x))  
//#define lson o<<1, L, mid  
//#define rson o<<1 | 1, mid+1, R  
typedef long long LL;
using namespace std;

int s[maxn];
int sa[maxn], t[maxn], t2[maxn], c[maxn];
void build(int n, int m)
{
	int i, *x = t, *y = t2, k, p;
	for(i = 0; i < m; i++) c[i] = 0;
	for(i = 0; i < n; i++) c[x[i] = s[i]]++;
	for(i = 1; i < m; i++) c[i] += c[i-1];
	for(i = n-1; i >= 0; i--) sa[--c[x[i]]] = i;
	for(k = 1; k <= n; k<<=1) {
		p = 0;
		for(i = n-k; i < n; i++) y[p++] = i;
		for(i = 0; i < n; i++) if(sa[i] >= k) y[p++] = sa[i] - k;
		for(i = 0; i < m; i++) c[i] = 0;
		for(i = 0; i < n; i++) c[x[y[i]]]++;
		for(i = 1; i < m; i++) c[i] += c[i-1];
		for(i = n-1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i];
		swap(x, y), p = 1, x[sa[0]] = 0;
		for(i = 1; i < n; i++)
			x[sa[i]] = y[sa[i]] == y[sa[i-1]] && y[sa[i]+k] == y[sa[i-1]+k] ? p-1 : p++;
		if(p >= n) break;
		m = p;
	}
}
int rank[maxn], height[maxn];
void getheight(int n)
{
	int i, j, k = 0;
	for(i = 0; i <= n; i++) rank[sa[i]] = i;
	for(i = 0; i < n; i++) {
		if(k) k--;
		j = sa[rank[i]-1];
		while(s[i+k] == s[j+k]) k++;
		height[rank[i]] = k;
	}
}
int work(int p, int k, int n)
{
	int cnt = 0, i;
	for(i = 1; i <= n; i++) {
		if(height[i] >= p) cnt++;
		else {
			if(cnt >= k) return 1;
			cnt = 0;
		}
	}
	if(cnt >= k) return 1;
	else return 0;
}
void solve(int n, int k)
{
	int res = 0, mid, bot = 0, top = n;
	while(top >= bot) {
		mid = (top+bot)>>1;
		if(work(mid, k, n)) bot = mid+1, res = mid;
		else top = mid-1;
	}
	printf("%d\n", res);
}
void debug(int n)
{
	int i;
	for(i = 1; i <= n; i++)
		printf("AAAA  %d\n", height[i]);
}
int main(void)
{
	int n, k, i;
	while(scanf("%d%d", &n, &k)!=EOF) {
		k--;
		for(i = 0; i < n; i++) {
			scanf("%d", &s[i]);
			s[i]++;
		}
		s[i] = 0;
		build(n+1, 1000001);
		getheight(n);
		//debug(n);
		solve(n, k);
	}
	return 0;
}