【后缀数组】poj-1743

/* 
 * File:   main.cpp
 * Author: lenovo
 *
 * Created on 2011年10月19日, 上午11:17
*/


/* 题目是求不可重叠最长重复子串
 * 分组：每组的后缀之间的height值都不小于k
 * 如果每组中sa值的最大减去sa值的最小大于k的话
 * 就满足条件
 * 这里用到了二分答案
 * 
*/
#include "cstdio"
#include "cstring"
#define maxn 20000

int wa[maxn],wb[maxn],wv[maxn],ws[maxn];//倍增算法构造后缀数组
int cmp(int *r,int a,int b,int l)
{
return r[a] == r[b] && r[a+l] == r[b+l];
}
void da(int *r,int *sa,int n,int m)
{
int i , j , p , *x = wa , *y = wb , *t;
for(i = 0 ; i < m ; i++)
        ws[i] = 0;
for(i = 0 ; i < n ; i++)
        ws[x[i]=r[i]]++;
for(i = 1 ; i < m ; i++)
        ws[i] += ws[i-1];
for(i = n-1 ; i >= 0 ; i--)
        sa[--ws[x[i]]] = i;
for(j = 1 , p = 1 ; p < n ; j *= 2 , m = p)
     {
for(p = 0 , 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 < n ; i++)
            wv[i] = x[y[i]];
for(i = 0 ; i < m ; i++)
            ws[i] = 0;
for(i = 0 ; i < n ; i++)
            ws[wv[i]]++;
for(i = 1 ; i < m ; i++)
            ws[i] += ws[i-1];
for(i = n-1 ; i >= 0 ; i--)
            sa[--ws[wv[i]]] = y[i];
for(t = x , x = y , y = t , p = 1 ,x[sa[0]] = 0 , i = 1 ; i < n ; i++)
            x[sa[i]] = cmp(y,sa[i-1],sa[i],j)?p-1:p++;
     }
return;
}
int rank[maxn] , height[maxn];
void calheight(int *r,int *sa,int n)
{
int i , j , k = 0;
for(i = 1 ; i <= n ; i++)
        rank[sa[i]] = i;
for(i = 0 ; i < n ; height[rank[i++]] = k)
for(k?k--:0 , j = sa[rank[i]-1] ; r[i+k] == r[j+k] ; k++)
            ;
return;
}
int r[maxn] , sa[maxn];
int n;

int check(int *sa , int n , int k)
{
int i , min = sa[1] , max = sa[2];
for(i = 2 ; i <= n ; i++)
    {
if(height[i] < k)    //分组的思想
        {
            min = sa[i] ;
            max = sa[i] ;
        }
else
        {
if(min > sa[i])
                min = sa[i];
if(max < sa[i])
                max =sa[i];
if(max - min > k)
return 1;
        }
    }
return 0;
}

int main()
{
while(scanf("%d",&n) && n)
    {
int j , k;
        n--;
        scanf("%d",&j);
for(int i = 0 ; i < n ; i++)
        {
            scanf("%d",&k);
            r[i] = k-j+100;
            j = k;
        }
        r[n] = 0;
        da(r,sa,n+1,200);
        calheight(r,sa,n);
int min , max , mid;
        min = 1 , max = n/2;
while(min <= max)
        {
            mid = (min+max)/2;
if(check(sa,n,mid))
                min = mid+1;
else
                max = mid-1;
        }
if(max >= 4)                //最少是5个音律
            printf("%d\n",max+1);
else
            printf("0\n");
    }
return 0;
}

转载于:https://www.cnblogs.com/zuckerTT/archive/2011/10/19/2217433.html