【HDU】1403 Longest Common Substring
2012-07-03 00:16
363 查看
#include<cstdio> #include<cstring> #include<algorithm> #define MAXN 200010 using namespace std; char s[MAXN]; int sa[MAXN],wa[MAXN],wb[MAXN],wv[MAXN],ws[MAXN]; int Rank[MAXN],height[MAXN]; inline bool cmp(int *r,int a,int b,int len) { return r[a]==r[b]&&r[a+len]==r[b+len]; } void 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]=s[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=p=1;p<n;j<<=1,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<m;i++) ws[i]=0; for(i=0;i<n;i++) ws[wv[i]=x[y[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,x[sa[0]]=0,p=i=1;i<n;i++) x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++; } } void Height(int n) { int i,j,k; for(i=1;i<=n;i++) Rank[sa[i]]=i; for(i=k=0;i<n;height[Rank[i++]]=k) for(k?k--:0,j=sa[Rank[i]-1];s[i+k]==s[j+k];k++); } int main() { int i,mid,len,ans; while(~scanf(" %s",s)) { mid=strlen(s); s[mid]='#'; scanf(" %s",s+mid+1); len=strlen(s); SA(len+1,'z'+1); Height(len); for(ans=0,i=1;i<len;i++) { if(sa[i]<mid&&sa[i-1]>mid||sa[i]>mid&&sa[i-1]<mid) ans=max(ans,height[i]); } printf("%d\n",ans); } return 0; }
相关文章推荐
- hdu 1403 Longest Common Substring (后缀数组模板)
- POJ 2774 Long Long Message&&HDU 1403 Longest Common Substring&&COJ 1203
- 【hdu 1403】Longest Common Substring
- hdu 1403 Longest Common Substring - 后缀数组
- HDU 1403 Longest Common Substring(后缀数组 最长公共子串)
- HDU 1403-Longest Common Substring (后缀数组)
- HDU 1403 Longest Common Substring(后缀数组,最长公共子串)
- HDU1403 Longest Common Substring
- HDU 1403 Longest Common Substring
- HDU 1403 Longest Common Substring(后缀数组入门)
- HDU 1403 Longest Common Substring(最长公共子串)
- poj2774 Long Long Message && hdu 1403 Longest Common Substring 最长公共字串【后缀数组(倍增)】
- hdu1403---Longest Common Substring(后缀数组求2个字符串的最长公共子串)
- POJ 2774 Long Long Message&&HDU 1403 Longest Common Substring&&COJ 1203
- hdu 1403 Longest Common Substring(最长公共子字符串)(后缀数组)
- hdu 1403 Longest Common Substring
- hdu 1403 Longest Common Substring 后缀数组求最长公共子串
- HDU - 1403 - Longest Common Substring
- Hdu1403 Longest Common Substring
- POJ 2774 Long Long Message+Hdu 1403 Longest Common Substring (后缀数组 最长公共子串)