poj 2774 lcp

来源：互联网发布：什么是网络摄像头编辑：程序博客网时间：2024/04/29 05:05
写的太逗多加了一个int
#include <cstdio>#include <cstring>#define maxn 200010char s[maxn];int n,m,sa[maxn],rank[maxn],height[maxn];int wa[maxn],wb[maxn],ws[maxn],wv[maxn];inline bool cmp(int *r,int a,int b,int l){    return (r[a] == r[b]) && (r[a+l] == r[b+l]);}inline void da(int n,int m){    int i,j,p,*x=wa,*y=wb,*t;    memset(ws,0,sizeof(ws));    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=1,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<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++;    }}inline void calcheight(){    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];s[i+k]==s[j+k];k++);}int main(){    char s1[111111],s2[111111];    while(~scanf("%s%s",s1,s2)){        int a=(int)strlen(s1);        int b=(int)strlen(s2);        for(int i=0;i<a;++i)s[i]=s1[i];        s[a]=1;        for(int i=0;i<b;++i)s[i+a+1]=s2[i];                n=a+b+1;     //已定义 千万不要int了        da(n+1,255);        calcheight();        int ans=0,tmp=0;        for(int i=2;i<=n;++i)            if(ans<height[i])            if((sa[i]<a&&sa[i-1]>a)||(sa[i]>a&&sa[i-1]<a)){                    ans=height[i];                    tmp=sa[i];                }        printf("%d\n",ans);    }    return 0;}
0 0