poj 2752 Seek the Name, Seek the Fame （KMP纯模版）

Description

Input

Output

Sample Input

ababcababababcabab
aaaaa

Sample Output

2 4 9 18
1 2 3 4 5
#include<iostream>
#include<sstream>
#include<algorithm>
#include<cstdio>
#include<string.h>
#include<cctype>
#include<string>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
using namespace std;
char cnt[400004];
int next[400004];

void get_next(char *s,int len)
{
    next [0]=-1;
    int j=-1,i=0;
    while(i<len)
    {
        if(j==-1||s[i]==s[j])
        {
            i++;
            j++;
            next[i]=j;
        }
        else
            j=next[j];
    }
}
int main()
{
    while(scanf("%s",cnt)!=EOF)
    {
        stack<int>sk;
        int k=strlen(cnt);
        memset(next,0,sizeof(next));
        get_next(cnt,strlen(cnt));

        int t;
        while(k>0)
        {
            sk.push(k);
            t=next[k];
            k=t;
        }
        while(!sk.empty())
        {
            cout<<sk.top()<<" ";
            sk.pop();
        }
        cout<<endl;
    }
    return 0;
}