POJ 1743 Musical Theme 后缀数组+二分

http://poj.org/problem?id=1743
A musical melody is represented as a sequence of N (1<=N<=20000)notes that are integers in the range 1…88, each representing a key on the piano. It is unfortunate but true that this representation of melodies ignores the notion of musical timing; but, this programming task is about notes and not timings.
Many composers structure their music around a repeating &qout;theme&qout;, which, being a subsequence of an entire melody, is a sequence of integers in our representation. A subsequence of a melody is a theme if it:
is at least five notes long
appears (potentially transposed – see below) again somewhere else in the piece of music
is disjoint from (i.e., non-overlapping with) at least one of its other appearance(s)

Transposed means that a constant positive or negative value is added to every note value in the theme subsequence.
Given a melody, compute the length (number of notes) of the longest theme.
One second time limit for this problem’s solutions!
Input
The input contains several test cases. The first line of each test case contains the integer N. The following n integers represent the sequence of notes.
The last test case is followed by one zero.
Output
For each test case, the output file should contain a single line with a single integer that represents the length of the longest theme. If there are no themes, output 0.
Sample Input
30
25 27 30 34 39 45 52 60 69 79 69 60 52 45 39 34 30 26 22 18
82 78 74 70 66 67 64 60 65 80
0
Sample Output
5
Hint
Use scanf instead of cin to reduce the read time.
题目大意：找出序列中不重叠的两个子串，它们的变化趋势是相同的，比如$1,2,3,4,5$和$6,7,8,9,10$，输出这样的子串的最大长度。
思路：题目变形后就是找不可重叠最长重复子串的最大长度。对原序列进行差分，仍以上面的序列为例，我们得到了新序列：$1,1,1,1,1$和$1,1,1,1,1$，显然不可重叠的最长重复子串的最大长度就是5，而正解也是5。那么怎么得到这个长度呢，我们可以二分来判断。对于当前要判断的长度$mid$，在$height$数组中找到连续的一段且值$>=mid$的区间，判断这个区间内$sa$的最大值减去最小值是否$>mid$即可。

#include<iostream>
#include<cstdio>
#include<cstring>
#define maxn 20010
using namespace std;
int s[maxn];
int y[maxn],x[maxn],c[maxn],sa[maxn],rk[maxn],height[maxn];
int n,m;

inline void get_SA()
{
    for(int i=1;i<=n;++i) ++c[x[i]=s[i]];
	//c数组是桶
	//x[i]是第i个元素的第一关键字
    for(int i=2;i<=m;++i) c[i]+=c[i-1]; //m 输入字符串的 ASCII 上限
	//做c的前缀和，我们就可以得出每个关键字最多是在第几名 计数排序的思想
    for(int i=n;i>=1;--i) sa[c[x[i]]--]=i;
    for(int k=1;k<=n;k<<=1)
	{
        int num=0;
        for(int i=n-k+1;i<=n;++i) y[++num]=i;
		//y[i]表示第二关键字排名为i的数，第一关键字的位置
		//第n-k+1到第n位是没有第二关键字的 所以排名在最前面 要先处理
        for(int i=1;i<=n;++i) if(sa[i]>k) y[++num]=sa[i]-k;
		//排名为i的数 在数组中是否在第k位以后
		//如果满足(sa[i]>k) 那么它可以作为别人的第二关键字，就把它的第一关键字的位置添加进y就行了
		//所以i枚举的是第二关键字的排名，第二关键字靠前的先入队
        for(int i=1;i<=m;++i) c[i]=0;
		//初始化c桶
        for(int i=1;i<=n;++i) ++c[x[i]];
		//因为上一次循环已经算出了这次的第一关键字 所以直接加就行了
        for(int i=2;i<=m;++i) c[i]+=c[i-1]; //第一关键字排名为1~i的数有多少个
        for(int i=n;i>=1;--i) sa[c[x[y[i]]]--]=y[i],y[i]=0;
		//因为y的顺序是按照第二关键字的顺序来排的
		//第二关键字靠后的，在同一个第一关键字桶中排名越靠后
		//基数排序
        swap(x,y);
		//这里不用想太多，因为要生成新的x时要用到旧的，就把旧的复制下来，没别的意思
        x[sa[1]]=1;
        num=1;
        for(int 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;
		//因为sa[i]已经排好序了，所以可以按排名枚举，生成下一次的第一关键字
        if(num==n) break;
        m=num;
		//这里就不用那个m了，因为都有新的编号了
    }
}
inline void get_height()
{
    int k=0;
    for(int i=1;i<=n;++i) rk[sa[i]]=i;
    for(int i=1;i<=n;++i)
	{
        if(rk[i]==1) continue;//第一名height为0
        if(k) --k;//h[i]>=h[i-1]-1;
        int 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 check(int x)
{
	int MAX=0,MIN=2e4;
	for(int i=2;i<=n;i++)
	{
		if(height[i]>=x)
		{
			MAX=max(MAX,max(sa[i],sa[i-1]));
			MIN=min(MIN,min(sa[i],sa[i-1]));
			if(MAX-MIN>x)
				return 1;
		}
		else
			MAX=0,MIN=2e4;
	}
	return 0;
}

int main()
{
	while(~scanf("%d",&n)&&n)
	{
		for(int i=1;i<=n;i++)
			scanf("%d",&s[i]);
		if(n<10)
		{
			printf("0\n");
			continue;
		}
		m=200;
		memset(c,0,sizeof(c));
		for(int i=n;i>=1;i--)
			s[i]=s[i]-s[i-1]+100;
		get_SA();
		get_height();
		int l=1,r=n,mid;
		while(l<=r)
		{
			mid=l+r>>1;
			if(!check(mid))
				r=mid-1;
			else
				l=mid+1;
		}
		if(r>=4)
			printf("%d\n",r+1);
		else
			printf("0\n");
	}
	return 0;
}