/* POJ2752 Seek the Name, Seek the Fame */ #include <stdio.h> #include <string.h> char s[400000+1]; int next[400000+1]; int result[400000+1]; void setnext(char s[], int next[], int len) { next[0] = ⑴; int i = 0, j = ⑴; while (i < len) { if (j == ⑴ || s[i] == s[j]) { ++i; ++j; next[i] = j; } else j = next[j]; } } int main(void) { int count, t, i; while(scanf("%s", s) != EOF) { int len = strlen(s); // 計(jì)算next[]數(shù)組值 setnext(s, next, len); // 計(jì)算結(jié)果：從字符串的尾部開始，下1個(gè)只能在與后綴相同的前綴字符串中 count = 0; t = next[len - 1]; while(t != ⑴) { if(s[t] == s[len - 1]) result[count++] = t + 1; t = next[t]; } // 輸出結(jié)果 for(i=count⑴; i>=0; i--) printf("%d ", result[i]); printf("%d\n", len); } return 0; }