POJ 1743 Musical Theme（后缀数组）

Description

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.

题目大意：给N个数字，对着N个数字前后作差得到一段N-1个数字的序列，问重复出现两次且不重叠的子段最长有多长。（看清楚上面的题目噢）

思路：N个数字作差，得到N-1个数字的序列，求后缀数组，二分验证是否存在mid长度的符合要求的字符串。

代码（219MS）：

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
using namespace std;

const int MAXN = 20010;
int s[MAXN];
int n, sa[MAXN], height[MAXN], rank[MAXN], tmp[MAXN], c[MAXN];

void makesa(int m) {
    memset(c, 0, sizeof(c));
    for(int i = 0; i < n; ++i) ++c[rank[i] = s[i]];
    for(int i = 0; i < m; ++i) c[i] += c[i - 1];
    for(int i = 0; i < n; ++i) sa[--c[rank[i]]] = i;
    for(int k = 1; k < n; k <<= 1) {
        for(int i = 0; i < n; ++i) {
            int j = sa[i] - k;
            if(j < 0) j += n;
            tmp[c[rank[j]]++] = j;
        }
        int j = c[0] = sa[tmp[0]] = 0;
        for(int i = 1; i < n; ++i) {
            if(rank[tmp[i]] != rank[tmp[i - 1]] || rank[tmp[i] + k] != rank[tmp[i - 1] + k])
                c[++j] = i;
            sa[tmp[i]] = j;
        }
        memcpy(rank, sa, n * sizeof(int));
        memcpy(sa, tmp, n * sizeof(int));
        if(j >= n - 1) break;
    }
}

void calheight() {
    int j, k = 0;
    for(int i = 0; i < n; height[rank[i++]] = k) {
        if(k > 0) --k;
        for(j = sa[rank[i] - 1]; s[i + k] == s[j + k]; ++k);
    }
}

bool check(int k) {
    int mx = sa[0], mn = sa[0];
    for(int i = 1; i < n; ++i) {
        if(height[i] >= k - 1) {
            mx = max(mx, sa[i]);
            mn = min(mn, sa[i]);
        } else {
            if(mx - mn >= k) return true;
            mx = mn = sa[i];
        }
    }
    return mx - mn >= k;
}

int solve() {
    int l = 1, r = n;
    while(l < r) {
        int mid = (l + r) >> 1;
        if(check(mid)) l = mid + 1;
        else r = mid;
    }
    return l - 1;
}

int main() {
    while(scanf("%d", &n) != EOF && n) {
        for(int i = 0; i < n; ++i) scanf("%d", &s[i]);
        for(int i = 0; i < n - 1; ++i) s[i] = s[i + 1] - s[i] + 88;
        s[n - 1] = 0;
        makesa(176);
        if(n != 1) calheight();
        int ans = solve();
        printf("%d
", ans >= 5 ? ans : 0);
    }
}