kmp, next 数组

1) poj1961

#include <stdio.h>
char s[1000005];
int num[1000005];
int main()
{
    int n,case1=1;

    while(scanf("%d",&n),n)
    {
        scanf("%s",s);
        int j=-1;
        num[0]=-1;
        for(int i=0;i<n;)
        {
            if(j==-1||s[i]==s[j])num[++i]=++j;
            else j=num[j];
        }
        printf("Test case #%d\n", case1++);
        for(int i=1;i<=n;i++)
        {
            if(i%(i-num[i])==0&&i!=(i-num[i]))printf("%d %d\n",i,i/(i-num[i]));
        }
        puts("");
    }
    return 0;
}

2) poj2752

#include <iostream>
#include <string>
#include <string.h>
#include <stdio.h>

using namespace std;
string p;
int coun[400010];
int next[400010];
int lenth;
void Get_next(){
    int j=0;
    int k=-1;
    next[0]=-1;
    while(j<lenth){
        if(k==-1||p[j]==p[k]){
            next[++j]=++k;
        }
        else{
            k=next[k];
        }
    }
    return ;
}
int main()
{

    while(cin>>p){
        int star=0;
        lenth=p.size();
        Get_next();

        coun[star]=lenth;
        while(next[lenth]!=0){
            coun[++star]=next[lenth];
            lenth=next[lenth];
        }

        printf("%d",coun[star]);
        for(int i=star-1;i>=0;i--){
            printf(" %d",coun[i]);
        }
        printf("\n");
    }

    return 0;
}