POJ - 1743 Musical Theme

1.题面

http://poj.org/problem?id=1743

2.题意

抽象之后意思大概是，给你一个数组，求长度最长，且不重叠的公共子串

3.思路

书上的基础题，可怜我因为一个二分挣扎了好久

用后缀数组获得height数组后，二分最长长度k用k将height分组

如果某一组height中，存在两个i,j满足sa[i],sa[j]>=k就说明符合条件

这道题的我一开始出错的地方是傻乎乎的将m值用128代，但在这里会有m超过128的情况，算是一个我容易犯的错的，暂且归入坑题一类

4.代码

/*****************************************************************
    > File Name: Cpp_Acm.cpp
    > Author: Uncle_Sugar
    > Mail: uncle_sugar@qq.com
    > Created Time: 2016年07月30日 星期六 21时03分33秒
*****************************************************************/
# include <cstdio>
# include <cstring>
# include <cctype>
# include <cmath>
# include <cstdlib>
# include <climits>
# include <iostream>
# include <iomanip>
# include <set>
# include <map>
# include <vector>
# include <stack>
# include <queue>
# include <algorithm>
using namespace std;

# define rep(i,a,b) for (i=a;i<=b;i++)
# define rrep(i,a,b) for (i=b;i>=a;i--)

template<class T>void PrintArray(T* first,T* last,char delim=' '){ 
	for (;first!=last;first++) cout << *first << (first+1==last?'\n':delim); 
}

const int debug = 1;
const int size  = 10 + 20000; 
const int INF = INT_MAX>>1;
typedef long long ll;

int t1[size],t2[size],c[size];

bool cmp(int *r,int a, int b,int l){
	return r[a] == r[b] && r[a+l] == r[b+l];
}

void da(int str[],int sa[],int rrank[],int height[],int n,int m){
	n++;
	int i, j, p, *x = t1, *y = t2;
	for (i = 0;i < m;i++) c[i] = 0;
	for (i = 0;i < n;i++) c[x[i] = str[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;
		for (i = n-j; i < n; i++)	y[p++] = i;
		for (i = 0; i < n; i++)	if (sa[i] >= j) y[p++] = sa[i] - j; 

		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];

		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++) rrank[sa[i]] = i;
	for (i = 0; i< n; i++){
		if (k) k--;
		j = sa[rrank[i]-1];
		while (str[i+k] == str[j+k]){
			k++;
		}
		height[rrank[i]] = k;
	}
}

int sa[size],rank[size],height[size];

int n;	

bool isok(int w){
	int ma = -INF,mi = INF;
	for (int i=1;i<=n;i++){
		if (height[i]>=w){
			ma = max(ma,max(sa[i-1],sa[i]));
			mi = min(mi,min(sa[i-1],sa[i]));
			if (ma - mi >= w)
				return true;
		}else {
			ma = -INF;
			mi = INF;
		}
	}
	if (ma - mi>= w)
		return true;
	return false;
}


int str[size];
int main()
{
	//# std::ios::sync_with_stdio(false);cin.tie(0);
	int i,j;
	while (~scanf("%d",&n)){
		if (n==0) break;
		for (i=0;i<n;i++)
			scanf("%d",str+i);
		int m = 0;
		for (i=0;i<n-1;i++){
			str[i] = str[i+1] - str[i] + 88;
			m = max(m,str[i]+1);
		}
		str[n=n-1] = 0;

		//# void da(int str[], int sa[] ,int rank[] ,int height[], int n, int m){
		da(str,sa,rank,height,n,m);
		int l = 0, r = n/2+1;		
		int ans = 0;
		while (l < r-1){
			int mid = r+l>>1;
			if (isok(mid)){
				l = mid;
			}else {
				r = mid;
			}
		}
		ans = l;
		printf("%d\n",ans<4?0:ans+1);
	}
	return 0;
}