poj1743后缀数组+二分

此题纯粹是拿来练模板的。。。唯一的trick就是把原串换成差值吧。。。。

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int	buc[30000], sa[30000], rk[30000], rky[30000],height[30000];
int s[30000];
void saa(int *s, int len)
{
	int m = len >= 200 ? len : 200;
	for (int i = 0; i <= m; i++)buc[i] = 0;
	for (int i = 1; i <= len; i++)buc[rk[i]=s[i]]++;
	for (int i = 1; i <= m; i++)buc[i] += buc[i - 1];
	for (int i = len; i >= 1; i--)sa[buc[s[i]]--] = i;
	for (int k = 1; k <= len; k<<=1)
	{
		int p = 1;
		for (int i = len; i >= len - k + 1; i--)rky[p++] = i;
		for (int i = 1; i <= len; i++)if (sa[i] > k)rky[p++] = sa[i]-k;
		for (int i = 0; i <= m; i++)buc[i] = 0;
		for (int i = 1; i < p; i++)buc[rk[rky[i]]]++;
		for (int i = 1; i <= m; i++)buc[i] += buc[i - 1];
		for (int i = p-1; i >= 1; i--)sa[buc[rk[rky[i]]]--] = rky[i];
		swap(rk, rky);
		rk[sa[1]] = 1; int q = 2;
		for (int i = 2; i <= len; i++)
		{
			if (rky[sa[i]] == rky[sa[i - 1]] && rky[sa[i] + k] == rky[sa[i - 1] + k])
				rk[sa[i]] = q-1;
			else
				rk[sa[i]] = q++;
		}
		int m = q;
		if (q > len)break;
	}
}
void getheight(int *s,int len)
{
	int h = 0;
	for (int i = 1; i <=len; i++)
	{
		if (h > 0)h--;
		int nexpos = sa[rk[i] + 1];
		while (s[i + h] == s[nexpos + h])
			h++;
		height[rk[i]] = h;
	}
}
bool check(int len,int k)
{
	int l = 1;
	while (l < len)
	{
		int maxx = -1, minn = 1000000000;
		while (height[l] >= k&&l<len)
		{
			maxx = max(maxx, sa[l]);
			maxx = max(maxx, sa[l + 1]);
			minn = min(minn, sa[l]);
			minn = min(minn, sa[l + 1]);
			l++;
		}
		l++;
		if (maxx - minn >= k)return true;
	}
	return false;
}
int main()
{
	int n;
	while (scanf("%d", &n) && n)
	{
         int temp1 = 1; int temp2;
		for (int i = 1; i <= n; i++)
		{
			scanf("%d", &s[i]);
			temp2 = s[i];
			if (i == 1)
			{
				temp1 = s[i];
				continue;
			}
			s[i-1] = (s[i] - temp1);
			temp1 = temp2;
		}
		n--;
		for (int i = 1; i <= n; i++)s[i] += 100;
		saa(s, n);
		getheight(s, n);
		int l = 0; int r = n;
		while (l < r)
		{
			int mid = (l + r)/2+ 1;
			if (check(n, mid))
				l = mid;
			else
				r = mid - 1;
		}
		if (l >= 4)
			printf("%d\n", l + 1);
		else
			printf("0\n");
	}
	return 0;
}