spoj8222

地址：

题目：

NSUBSTR - Substrings

no tags 

 

You are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal number of times that some string with length x appears in S. For example for string 'ababa' F(3) will be 2 because there is a string 'aba' that occurs twice. Your task is to output F(i) for every i so that 1<=i<=|S|.

Input

String S consists of at most 250000 lowercase latin letters.

Output

Output |S| lines. On the i-th line output F(i).

Example

Input:
ababa

Output:
3
2
2
1
1

 

 思路：

　　先求出每个状态的endpos集合大小，用cnt记录，用cnt[s]去更新f[len[s]],再用f[i+1]去更新f[i].

#include <bits/stdc++.h>

using namespace std;

char ss[300004];
int ans,f[300001<<1];

struct SAM
{
    static const int MAXN = 300001<<1;//大小为字符串长度两倍
    static const int LetterSize = 26;

    int tot, last, ch[MAXN][LetterSize], fa[MAXN], len[MAXN];
    int sum[MAXN], tp[MAXN], cnt[MAXN]; //sum,tp用于拓扑排序，tp为排序后的数组

    void init( void)
    {
        last = tot = 1;
        len[1] = 0;
        memset(ch,0,sizeof ch);
        memset(fa,0,sizeof fa);
        memset(cnt,0,sizeof cnt);
    }

    void add( int x)
    {
        int p = last, np = last = ++tot;
        len[np] = len[p] + 1, cnt[last] = 1;
        while( p && !ch[p][x]) ch[p][x] = np, p = fa[p];
        if( p == 0)
            fa[np] = 1;
        else
        {
            int q = ch[p][x];
            if( len[q] == len[p] + 1)
                fa[np] = q;
            else
            {
                int nq = ++tot;
                memcpy( ch[nq], ch[q], sizeof ch[q]);
                len[nq] = len[p] + 1, fa[nq] = fa[q], fa[q] = fa[np] = nq;
                while( p && ch[p][x] == q)  ch[p][x] = nq, p = fa[p];
            }
        }
    }

    void toposort( void)
    {
        for(int i = 1; i <= len[last]; i++)   sum[i] = 0;
        for(int i = 1; i <= tot; i++)   sum[len[i]]++;
        for(int i = 1; i <= len[last]; i++)   sum[i] += sum[i-1];
        for(int i = 1; i <= tot; i++)   tp[sum[len[i]]--] = i;
        for(int i = tot; i; i--)   cnt[fa[tp[i]]] += cnt[tp[i]];
    }
} sam;


int main(void)
{
    //freopen("in.acm","r",stdin);
    sam.init();
    scanf("%s",ss);
    for(int i=0,len=strlen(ss);i<len;i++)  sam.add(ss[i]-'a');
    sam.toposort();
    for(int i=1;i<=sam.tot;i++)    f[sam.len[i]]=max(f[sam.len[i]],sam.cnt[i]);
    for(int i=sam.len[sam.last];i;i--) f[i]=max(f[i],f[i+1]);
    for(int i=1;i<=sam.len[sam.last];i++)   printf("%d\n",f[i]);
    return 0;
}