HDU1403 Longest Common Substring【后缀数组】

 

Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Problem Description

Given two strings, you have to tell the length of the Longest Common Substring of them.
For example:
str1 = banana
str2 = cianaic
So the Longest Common Substring is "ana", and the length is 3.

Input

The input contains several test cases. Each test case contains two strings, each string will have at most 100000 characters. All the characters are in lower-case.
Process to the end of file.

Output

For each test case, you have to tell the length of the Longest Common Substring of them.

Sample Input

banana

cianaic

Sample Output

3

题意：找出两个字符串的最长公共子串长度

分析：后缀数组板子题 但是好像也没太搞懂板子的实现过程 大概掌握应用 先贴在这里 

#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+7;
char str[maxn];
int sa[maxn],rk[maxn],ht[maxn],sum[maxn],tp[maxn];
bool cmp(int *f,int x,int y,int w) {return f[x]==f[y] && f[x+w]==f[y+w];}
void get_sa(char *s,int n,int m)
{
    for (int i=0;i<m;i++) sum[i]=0;
    for (int i=0;i<n;i++) sum[rk[i]=s[i]]++;
    for (int i=1;i<m;i++) sum[i]+=sum[i-1];
    for (int i=n-1;i>=0;i--) sa[--sum[rk[i]]]=i;
    for (int len=1;len<=n;len<<=1)
    {
        int p=0;
        for (int i=n-len;i<n;i++) tp[p++]=i;
        for (int i=0;i<n;i++) if(sa[i]>=len) tp[p++]=sa[i]-len;
        for (int i=0;i<m;i++) sum[i]=0;
        for (int i=0;i<n;i++) sum[rk[tp[i]]]++;
        for (int i=1;i<m;i++) sum[i]+=sum[i-1];
        for (int i=n-1;i>=0;i--) sa[--sum[rk[tp[i]]]]=tp[i];
        swap(rk,tp);
        p=1;
        rk[sa[0]]=0;
        for (int i=1;i<n;i++) rk[sa[i]]=cmp(tp,sa[i-1],sa[i],len)?p-1:p++;
        if(p>=n) break;
        m=p;
    }
    int k=0;
    n--;
    for (int i=0;i<=n;i++) rk[sa[i]]=i;
    for (int i=0;i<n;i++)
    {
        if(k) k--;
        int j=sa[rk[i]-1];
        while (s[i+k]==s[j+k]) k++;
        ht[rk[i]]=k;
    }
}
int main()
{
    char str[maxn];
    while (~scanf("%s",str))
    {
        int len=strlen(str);
        str[len]='0';
        scanf("%s",str+len+1);
        int n=strlen(str);
        str[n]=0;
        get_sa(str,n+1,'z'+1);
        int ans=0;
        for (int i=1;i<n;i++)
        {
            if(sa[i]>len && sa[i-1]<len) ans=max(ans,ht[i]);
            if(sa[i]<len && sa[i-1]>len) ans=max(ans,ht[i]);
        }
        printf("%d\n",ans);
    }
    return 0; 
}