题意:
题目链接:http://poj.org/problem?id=1743
求一个串中长度最长两个不重叠的相似子串的长度,相似定义为两个串长度相同,且相同下标的数字差相同。如:1,3,2和7,9,8,差都是6。
思路:
两个串的相似,还可以理解为每个串相邻的两个数字差都相同,因此要把原串转化成差的串,然后对新串求height数组,二份答案,每个答案x,对height分组,看每一组中下标差是否大于等于x即可。
代码:
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 2e4 + 10;
const int INF = 0x3f3f3f3f;
int t1[MAXN], t2[MAXN], c[MAXN];
bool cmp(int *r, int a, int b, int l) {
return r[a] == r[b] && r[a + l] == r[b + l];
}
void build(int a[],int sa[],int rk[],int height[],int n,int m) {
n++;
int i, j, p, *x = t1, *y = t2;
//第一轮基数排序,如果s的最大值很大,可改为快速排序
for(i = 0; i < m; i++) c[i] = 0;
for(i = 0; i < n; i++) c[x[i] = a[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(j = 1; j <= n; j <<= 1) {
p = 0;
//直接利用sa数组排序第二关键字
for(i = n-j; i < n; i++)y[p++] = i;//后面的j个数第二关键字为空的最小
for(i = 0; i < n; i++)if(sa[i] >= j)y[p++] = sa[i] - j;
//这样数组y保存的就是按照第二关键字排序的结果
//基数排序第一关键字
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];
//根据sa和x数组计算新的x数组
swap(x,y);
p = 1;
x[sa[0]] = 0;
for(i = 1; i < n; i++)
x[sa[i]] = cmp(y,sa[i-1],sa[i],j)?p-1:p++;
if(p >= n)break;
m = p;//下次基数排序的最大值
}
int k = 0;
n--;
for(i = 0; i <= n; i++)rk[sa[i]] = i;
for(i = 0; i < n; i++)
{
if(k) k--;
j = sa[rk[i]-1];
while(a[i+k] == a[j+k])
k++;
height[rk[i]] = k;
}
}
int n;
int sa[MAXN], height[MAXN], rk[MAXN], a[MAXN];
bool ok (int x) {
int Min = sa[0], Max = sa[0];
for (int i = 1; i < n; i++) {
if (height[i] >= x) {
Min = min (Min, sa[i]);
Max = max (Max, sa[i]);
}
else {
if (Max - Min >= x)
return 1;
Max = sa[i];
Min = sa[i];
}
}
return Max - Min >= x;
}
int solve (int l, int r) {
int res = -1;
while (l <= r) {
int mid = (r + l) >> 1;
if (ok (mid)) {
res = mid;
l = mid + 1;
}
else r = mid - 1;
}
return res;
}
int main(){
while (scanf ("%d", &n), n) {
for (int i = 0; i < n; i++) {
scanf ("%d", &a[i]);
}
if (n < 10) {
puts("0");
continue;
}
for (int i = 0; i < n - 1; i++) {
a[i] = 100 + a[i + 1] - a[i];
}
a[n - 1] = 0;
build(a, sa, rk, height, n, 188);
int ans = solve (0, n / 2) + 1;
printf ("%d\n", (ans >= 5 ? ans : 0));
}
return 0;
}