}
else
{
for(int j=0; j
{
if(lock == 0)
{
ans_num = 0;
lock = 1;
}
res[ans_num++] = sa[i-1];
}
memset(flag,0,sizeof(flag));
t = 0;
}
}
//处理最后的段
t = 0;
for(int j=0; j
{
if(lock == 0)
{
ans_num = 0;
lock = 1;
}
res[ans_num++] = sa[n-1];
}
if(lock == 1) return true;
return false;
}
void binarySearch(int _l,int _r)
{
int l = _l,r = _r;
int mid;//最长的长度
int ans_len = l;
int lock = 0;
while(l < r)
{
mid = (l + r + 1)/2;
if(possible(mid))
{
lock = 1;
ans_len = mid;
l = mid;
}
else
{
r = mid - 1;
}
}
if(!lock)
{
puts(" ");
return;
}
for(int i=0; i
for(int j=res[i]; j
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif
int len;
int r = 0,l = 0;
char temp[1500];
int cas = 0;
while(scanf(" %d",&n)!=EOF && n!=0)
{
cas++;
if(cas!=1) puts("");
tot = 0;
l = 1;
r = 0;//最长的长度
for(int i=0; i
scanf(" %s",temp);
len = strlen(temp);
if(len > r) r = len;
for(int j=0; j
num[tot] = i;
s[tot++] = temp[j] - 'a' + 1;
}
s[tot++] = 26 + i + 1;
}
s[tot++] = 0;
if(n == 1)
{
printf("%s\n",temp);
continue;
}
build_sa(tot,26 + n + 1);
//注意传递的参数是长度-1
getHeight(tot-1);
binarySearch(l,r);
}
return 0;
}