后缀数组--可重叠的K次最长重复子串(POJ3261)

print #include
#include
#define N 1000010

int wa[N],wb[N],wv[N],ws[N];
int rank[N],height[N];
int sa[N],r[N];

int abs(int x)
{
return x<0 -x:x;
}

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 for(i=0; i for(i=1; i for(i=n-1; i>=0; i--) sa[--ws[x[i]]]=i;
for(p=1,j=1; p {
for(p=0,i=n-j; i for(i=0; i=j) y[p++]=sa[i]-j;
for(i=0; i for(i=0; i for(i=0; i for(i=1; i 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 x[sa[i]]=cmp(y,sa[i-1],sa[i],j) p-1:p++;
}
}

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 for(k k--:0,j=sa[rank[i]-1]; r[i+k]==r[j+k]; k++);
}

bool check(int mid,int len,int k)
{
int i,j,tot=0;
for(i=2;i<=len;i++)
{
if(height[i] else
{
tot++;
if(tot==k-1) return true;
}
}
return false;
}

int Binary(int st,int ed,int len,int k)
{
int l=st,r=ed,mid;
while(l {
mid=(l+r+1)/2;
if(check(mid,len,k)) l=mid;
else r=mid-1;
}
return l;
}

int main()
{
int i,j,n,k,ans;
while(~scanf("%d%d",&n,&k))
{
for(i=0;i {
scanf("%d",&r[i]);
r[i]++;
}
r[n]=0;
da(r,sa,n+1,1000002);
calheight(r,sa,n);
int ans=Binary(0,n,n,k);
printf("%d\n",ans);
}
return 0;
}

#include
#include
#define N 1000010

int wa[N],wb[N],wv[N],ws[N];
int rank[N],height[N];
int sa[N],r[N];

int abs(int x)
{
return x<0 -x:x;
}

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 for(i=0; i for(i=1; i for(i=n-1; i>=0; i--) sa[--ws[x[i]]]=i;
for(p=1,j=1; p {
for(p=0,i=n-j; i for(i=0; i=j) y[p++]=sa[i]-j;
for(i=0; i for(i=0; i for(i=0; i for(i=1; i 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 x[sa[i]]=cmp(y,sa[i-1],sa[i],j) p-1:p++;
}
}

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 for(k k--:0,j=sa[rank[i]-1]; r[i+k]==r[j+k]; k++);
}

bool check(int mid,int len,int k)
{
int i,j,tot=0;
for(i=2;i<=len;i++)
{
if(height[i] else
{
tot++;
if(tot==k-1) return true;
}
}
return false;
}

int Binary(int st,int ed,int len,int k)
{
int l=st,r=ed,mid;
while(l {
mid=(l+r+1)/2;
if(check(mid,len,k)) l=mid;
else r=mid-1;
}
return l;
}

int main()
{
int i,j,n,k,ans;
while(~scanf("%d%d",&n,&k))
{
for(i=0;i {
scanf("%d",&r[i]);
r[i]++;
}
r[n]=0;
da(r,sa,n+1,1000002);
calheight(r,sa,n);
int ans=Binary(0,n,n,k);
printf("%d\n",ans);
}
return 0;
}