北大OJ 2752

Seek the Name, Seek the Fame 
Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 9   Accepted Submission(s) : 3
Problem Description
The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the same time seek the fame. In order to escape from such boring job, the innovative little cat works out an easy but fantastic algorithm: 

Step1. Connect the father's name and the mother's name, to a new string S. 
Step2. Find a proper prefix-suffix string of S (which is not only the prefix, but also the suffix of S). 

Example: Father='ala', Mother='la', we have S = 'ala'+'la' = 'alala'. Potential prefix-suffix strings of S are {'a', 'ala', 'alala'}. Given the string S, could you help the little cat to write a program to calculate the length of possible prefix-suffix strings of S? (He might thank you by giving your baby a name:) 

 

Input
The input contains a number of test cases. Each test case occupies a single line that contains the string S described above. 

Restrictions: Only lowercase letters may appear in the input. 1 <= Length of S <= 400000. 

 

Output
For each test case, output a single line with integer numbers in increasing order, denoting the possible length of the new baby's name.
 

Sample Input
ababcababababcabab
aaaaa
 

Sample Output
2 4 9 18
1 2 3 4 5

分析：此题主要考察对数据结构中KMP算法理解与应用，题目要求我们在主串的前后两部分找出相等的子串并输出子串的长度，前后子串可以重叠。其解思路就是KMP的思路。

代码：

/* 功能Function Description:     字符串匹配 
   开发环境Environment:          DEV C++ 4.9.9.1
   技术特点Technique:            未改进的 KMP算法 
   版本Version:                  1
   作者Author:               qing du
   日期Date:                 20120808
   备注Notes:
*/

#include <iostream>
#include <cstring>
#include <stdlib.h>
using namespace std;
typedef char *SString;
int len,next[1010];

void get_next(SString s)  // KMP算法 
{
     int i,j;
     i=0; next[0]=-1; j=-1;
     while(i<len)
     {
          if(j==-1||s[i]==s[j])
          {
              ++i;
              ++j;
              next[i]=j;
          }
          else  j=next[j];
     }
}


void output(int i)
{
     if(next[i]!=0)
     {
          output(next[i]);
          cout<<next[i]<<' ';
     }
     else return;
     
}

int main()
{
   char a[1010];   
   while(cin>>a)
    {                  
       len=strlen(a);
       //cout<<len<<endl; 
       get_next(a);
       output(len);
       cout<<len<<endl;
       for(int i=0;i<len+1;i++)
             cout<<next[i]<<' ';  
     }
    system("pause");
    return 0;
    
}