bzoj1717.产奶的模式

给出一个长度为 n 的数字序列和一个 K，求最长的出现了至少 K 次的子序列的长度。

经典问题，求出 Height 数组， 二分答案然后判断是否有一组的后缀个数大于等于 K。

#include <cstdio>
#include <algorithm>

using namespace std;

const int MAX_N = 20005;

int n, K, a[MAX_N], sa[MAX_N], r[MAX_N], h[MAX_N];
int ws[1000005], wv[MAX_N], wa[MAX_N], wb[MAX_N];

void da(int *a, int *sa, int n, int m) {
	int *x = wa, *y = wb;
	for (int i = 0; i < m; i ++) ws[i] = 0;
	for (int i = 0; i < n; i ++) ws[x[i] = a[i]] ++;
	for (int i = 1; i < m; i ++) ws[i] += ws[i - 1];
	for (int i = n - 1; i >= 0; i --) sa[-- ws[x[i]]] = i;
	for (int k = 1; k <= n; k <<= 1) {
		int p = 0;
		for (int i = n - k; i < n; i ++) y[p ++] = i;
		for (int i = 0; i < n; i ++) if (sa[i] >= k) y[p ++] = sa[i] - k;
		for (int i = 0; i < n; i ++) wv[i] = x[y[i]];
		for (int i = 0; i < m; i ++) ws[i] = 0;
		for (int i = 0; i < n; i ++) ws[wv[i]] ++;
		for (int i = 1; i < m; i ++) ws[i] += ws[i - 1];
		for (int i = n - 1; i >= 0; i --) sa[-- ws[wv[i]]] = y[i];
		swap(x, y); p = 1; x[sa[0]] = 0;
		for (int i = 1; i < n; i ++) x[sa[i]] = (y[sa[i - 1]] == y[sa[i]]) && (y[sa[i - 1] + k] == y[sa[i] + k]) ? p - 1 : p ++;
		if (p >= n) break; m = p;
	}
}
void calc() {
	for (int i = 1; i <= n; i ++) r[sa[i]] = i;
	int k = 0, j;
	for (int i = 0; i < n; h[r[i ++]] = k)
		for (k ? k -- : 0, j = sa[r[i] - 1]; a[i + k] == a[j + k]; k ++);
}
inline bool check(int x) {
	int j;
	for (int i = 2; i <= n; i ++) {
		for (; h[i] < x && i <= n; i ++);
		for (j = i; h[j] >= x; j ++);
		if (j - i + 1 < K) continue;
			else return 1;
	}
	return 0;
}
void init() {
	scanf("%d%d", &n, &K);
	for (int i = 0; i < n; i ++) scanf("%d", &a[i]);
	a[n] = 0;
	da(a, sa, n + 1, 1000000); calc();
}
void doit() {
	int l = 1, r = n, mid;
	while (l <= r) {
		mid = (l + r) >> 1;
		if (check(mid)) l = mid + 1;
		else r = mid - 1;
	}
	printf("%d\n", r);
}
int main() {
	init();
	doit();
	return 0;
}