1 #include<cstdio> 2 #include<cstdlib> 3 #include<cmath> 4 #include<cstring> 5 #include<algorithm> 6 #include<iostream> 7 #include<vector> 8 #include<map> 9 #include<set>10 #include<queue>11 #include<string>12 #define inf 100000000013 #define maxn 1000000+100014 #define maxm 20015 #define eps 1e-1016 #define pa pair<int,int>17 using namespace std;18 inline int read()19 {20     int x=0,f=1;char ch=getchar();21     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}22     while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}23     return x*f;24 }25 int n,len,pos[maxm],ll[maxm],sa[maxn],rank[maxn],wa[maxn],wb[maxn],wr[maxn],a[maxn],h[maxn];26 char s[maxn];27 inline bool cmp(int *r,int a,int b,int l)28 {29     return r[a]==r[b]&&r[a+l]==r[b+l];30 }31 void da(int *r,int *sa,int n,int m)32 {33     int i,j,p,*x=wa,*y=wb,*t;34         for(i=0;i<m;i++)wr[i]=0;35     for(i=0;i<n;i++)wr[x[i]=r[i]]++;36     for(i=1;i<m;i++)wr[i]+=wr[i-1];37     for(i=n-1;i>=0;i--)sa[--wr[x[i]]]=i;    38     for(j=1,p=1;p<n;j<<=1,m=p)39      { 40          for(p=0,i=n-j;i<n;i++)y[p++]=i;41          for(i=0;i<n;i++)if(sa[i]>=j)y[p++]=sa[i]-j;42          for(i=0;i<m;i++)wr[i]=0;43          for(i=0;i<n;i++)wr[x[y[i]]]++;44          for(i=1;i<m;i++)wr[i]+=wr[i-1];45          for(i=n-1;i>=0;i--)sa[--wr[x[y[i]]]]=y[i];46          for(t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1;i<n;i++)47           x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++;48      }49 }50 void geth(int *r,int *sa,int n)51 {52     int i,j,k=0;53     for(i=1;i<=n;i++)rank[sa[i]]=i;54     for(i=0;i<n;h[rank[i++]]=k)55      for(k?k--:0,j=sa[rank[i]-1];r[i+k]==r[j+k];k++);56 } 57 int main()58 {59    freopen("input.txt","r",stdin);60    freopen("output.txt","w",stdout);    61    scanf("%d",&n);62    len = 0;63    for (int i = 0;i < n;i ++){64        scanf("%s",s + len);65        pos[i] = len;66        len = strlen(s);67        ll[i] = len - pos[i];68        s[len ++] = ‘$‘;69    }70    for (int i = 0;i < len;i ++) a[i] = s[i];71    a[len]=0;72    da(a,sa,len+1,150);73    geth(a,sa,len);74    for (int i = 0;i < n;i ++){75        int t = rank[pos[i]],j,l,r;76        for (j = t;j && h[j] >= ll[i];j --);l=j+1;77        for (j = t + 1;j <=len && h[j] >=ll[i];j ++);r=j-1;78        printf("%d\n",r-l+2);79    }80    return 0;81 }