POJ 2752 (KMP 所有可能长度的前缀后缀) Seek the Name, Seek the Fame

 1 #include <cstdio>
 2 #include <cstring>
 3 
 4 const int maxn = 400000;
 5 char p[maxn];
 6 int next[maxn], a[maxn], l;
 7 
 8 void get_next(char* p, int l)
 9 {
10     int k = -1, j = 0;
11     next[0] = -1;
12     while(j < l)
13     {
14         if(k == -1 || p[k] == p[j])
15         {
16             k++;
17             j++;
18             next[j] = k;
19         }
20         else k = next[k];
21     }
22 }
23 
24 void output(int k)
25 {
26     if(next[k] > 0) output(next[k]);
27     if(k == l) printf("%d\n", l);
28     else printf("%d ", k);
29 }
30 
31 int main()
32 {
33     freopen("in", "r", stdin);
34     
35     while(scanf("%s", p) == 1)
36     {
37         memset(next, 0, sizeof(next));
38         
39         l = strlen(p);
40         get_next(p, l);
41         
42         int cnt = 0;
43         a[cnt++] = l;
44         output(l);
45     }
46     
47     return 0;
48 }