做这题之前推荐做一下hdu5008(西安网络赛),两题都是要先求不重复串个数,可以通过s[i]=s[i-1]+n-sa[i]-height[i]来求。先二分最大串在整个不重复串中的位置,然后在sa函数中找到后缀的位置,通过sa[i]+mid-s[p-1]+height[i]-1找到子串的结尾,然后再height数组找p+1到n这个后缀里面与子串的公共串,也就是说一定要在公共串里面的位置切一刀,如果公共串为0肯定不满足条件。把要切的位置记录下来,然后排序就是一个贪心的问题,可以通过分块来解决。
下面是AC代码:
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#define LL __int64
#define maxn 200100
using namespace std;
int wa[maxn],wb[maxn],wv[maxn],ws[maxn];
int r[maxn];
int Rank[maxn],sa[maxn],height[maxn];
int cmp(int *r,int a,int b,int le)
{
return r[a]==r[b]&&r[a+le]==r[b+le];
}
void da(int *r,int *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] = r[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*=2,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++;
}
return ;
}
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<n;height[Rank[i++]]=k)
for(k?k--:0,j=sa[Rank[i]-1];r[i+k]==r[j+k];k++);
return ;
}
char c[maxn];
struct pi{
int x;
int y;
}pp[maxn];
struct ppi{
int x;
int id;
int cover;
}pp1[2*maxn];
LL s[maxn];
int vis[maxn];
int get(LL k,int n){
int le,ri,mid;
le=1;
ri=n;
while(le<=ri){
mid=(le+ri)/2;
if(s[mid]<k) le=mid+1;
else ri=mid-1;
}
return le;
}
int min(int a,int b){
if(a>b) return b;
return a;
}
int cmp(pi a,pi b){
if(a.x!=b.x) return a.x<b.x;
return a.y<b.y;
}
int cmp1(ppi a,ppi b){
if(a.x!=b.x) return a.x<b.x;
return a.id>b.id;
}
int main()
{
int i,n,m,p,k,q,u,v;
LL le,ri,mid,f;
while(1){
scanf("%d",&k);
if(k==0) break;
k--;
scanf("%s",c);
n=(int)strlen(c);
for(i=0;i<n;i++){
r[i]=c[i]-'a'+1;
}
r[n]=0;
da(r,sa,n+1,20002);
calheight(r, sa, n);
for(i=1;i<=n;i++){
if(i==1) s[i]=n-sa[i];
else s[i]=s[i-1]+n-sa[i]-height[i];
}
le=1;
ri=s[n];
while(le<=ri){
mid=(le+ri)/2;
p=get(mid,n);
if(p==1)
f=mid-s[p-1];
else f=mid-s[p-1]+height[p];
m=0;
pp[m].x=sa[p];
pp[m++].y=sa[p]+f-1;
u=0;
q=f;
memset(vis,0,sizeof(vis));
for(i=p+1;i<=n;i++){
if(height[i]==0){
u=1;
break;
}
q=min(height[i],q);
pp[m].x=sa[i];
pp[m++].y=sa[i]+q-1;
}
if(u) le=mid+1;
else{
for(i=0;i<m;i++){
pp1[2*i].x=pp[i].x;
pp1[2*i].cover=i;
pp1[2*i].id=1;
pp1[2*i+1].x=pp[i].y;
pp1[2*i+1].id=-1;
pp1[2*i+1].cover=i;
}
sort(pp1,pp1+2*m,cmp1);
u=0;
v=0;
for(i=0;i<2*m;i++){
if(pp1[i].id==1){
vis[pp1[i].cover]=u;
}
else{
if(vis[pp1[i].cover]==u&&pp1[i].x!=n-1){
u++;
v++;
}
}
}
if(v<=k) ri=mid-1;
else le=mid+1;
}
}
p=get(le,n);
height[1]=0;
for(i=sa[p];i<=sa[p]+le-s[p-1]-1+height[p];i++) printf("%c",r[i]-1+'a');
printf("\n");
}
}