POJ1743 Musical Theme（二分+后缀数组）

题意：有一个长度N(1<=N<=20000)的数列，元素的范围是1~88。定义“theme”为一个长度不小于5的串s，且数组中还存在至少一个与它等长的串t，t中每个相邻元素之间的差值与s串相等，s和t不能相互覆盖。求最长的theme串的长度。

思路：题目要求两个子串的相邻元素差值相等，而后缀数组求的是匹配的串，我们可以求出数组中相邻元素的差值构成一个新的数组，即转化成了经典的最大不覆盖重复子串问题。二分结果串的长度x，将height数组按照x分组，同一组内的最大下标和最小下标之差大于x即可。

因为构造数组的时候原串中的中间一个元素可能被用两次，所以要用>x，不能用相等。详见这组数据：

11
2 3 4 5 6 7 8 9 10 11 12

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#include <cmath>
#include <list>
#include <cstdlib>
#include <set>
#include <map>
#include <vector>
#include <string>

using namespace std;

#define rint register int
typedef long long ll;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const int maxn = 20005;
const int mod = 2147493647;

int s[maxn], h[maxn];
int wa[maxn],wb[maxn],c[maxn],sa[maxn],rk[maxn],height[maxn];

//n是串长度，m是字符哈希值的范围
void get_SA(int n, int m) {
    int *x = wa, *y = wb; //x、y为指针变量才能调用swap
    for (rint i=0; i<=m; ++i) c[i] = 0;
    for (rint i=1; i<=n; ++i) ++c[x[i]=s[i]];
    for (rint i=1; i<=m; ++i) c[i]+=c[i-1];
    for (rint i=n; i>=1; --i) sa[c[x[i]]--]=i;
    for (rint k=1; k<=n; k<<=1) {
        rint num=0;
        for (rint i=n-k+1; i<=n; ++i) y[++num]=i;
        for (rint i=1; i<=n; ++i) if (sa[i]>k) y[++num]=sa[i]-k;
        for (rint i=0; i<=m; ++i) c[i]=0;
        for (rint i=1; i<=n; ++i) ++c[x[i]];
        for (rint i=1; i<=m; ++i) c[i]+=c[i-1];
        for (rint i=n; i>=1; --i) sa[c[x[y[i]]]--]=y[i],y[i]=0;
        swap(x,y);
        x[sa[1]]=1;
        num=1;
        for (rint i=2; i<=n; ++i)
            x[sa[i]]=(y[sa[i]]==y[sa[i-1]] && y[sa[i]+k]==y[sa[i-1]+k]) ? num : ++num;
        if (num==n) break;
        m=num;
    }
}
void get_height(int n) {
    rint k=0;
    for (rint i=1; i<=n; ++i) rk[sa[i]]=i;
    for (rint i=1; i<=n; ++i) {
        if (rk[i]==1) continue;//第一名height为0
        if (k) --k;//h[i]>=h[i-1]-1;
        rint j=sa[rk[i]-1];
        while (j+k<=n && i+k<=n && s[i+k]==s[j+k]) ++k;
        height[rk[i]]=k;//h[i]=height[rk[i]];
    }
}
bool jud(int n, int x) {
    int mx = -1, mn = -1;
    for (int i = 1; i <= n; ++i) {
        if (height[i] >= x) {
            if (i == 1) {
                mx = mn = sa[i];
            } else if (mx == -1) {
                mx = max(sa[i], sa[i - 1]);
                mn = min(sa[i], sa[i - 1]);
            } else {
                if (sa[i] > mx) {
                    mx = sa[i];
                }
                if (sa[i] < mn) {
                    mn = sa[i];
                }
            }
            if (mx - mn > x) {
                return true;
            }
        } else {
            mx = mn = -1;
        }
    }
    return false;
}
int main() {
    int n;
    while (~scanf("%d", &n) && n) {
        for (int i = 0; i < n; ++i) {
            scanf("%d", &h[i]);
        }
        for (int i = 1; i < n; ++i) {
            s[i] = h[i] - h[i - 1] + 100;
        }
        get_SA(n - 1, 200);
        get_height(n - 1);
        int l = 0, r = n;
        while (r - l > 1) {
            int mid = (r + l) >> 1;
            if (jud(n - 1, mid)) {
                l = mid;
            } else {
                r = mid;
            }
        }
        printf("%d\n", l >= 4 ? l + 1 : 0);
    }
    return 0;
}
/*
7
2 3 4 5 6 7 8
11
2 3 4 5 6 7 8 9 10 11 12
9
1 1 1 1 1 1 1 1 1
10
1 1 1 1 1 1 1 1 1 1
11
1 1 1 1 1 1 1 1 1 1 1
*/