首页 > 代码库 > KMP中next的应用 POJ 2752 Seek the Name, Seek the Fame
KMP中next的应用 POJ 2752 Seek the Name, Seek the Fame
Seek the Name, Seek the Fame
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 19163 | Accepted: 9849 |
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:)
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.
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
Source
POJ Monthly--2006.01.22,Zeyuan Zhu
这个题我只想说,一定要这样写!!!不然OTE大片!!!
while(scanf("%s",inn+1)!=EOF)
贴代码
1 #include<iostream> 2 #include<cstring> 3 #include<cstdio> 4 #include<algorithm> 5 using namespace std; 6 char inn[400010]; 7 int nextt[400010],outt[400010]; 8 int lenn; 9 int main(){ 10 while(scanf("%s",inn+1)!=EOF){ 11 lenn=strlen(inn+1); 12 int j=0; 13 for(int i=2;i<=lenn;i++){ 14 while(j&&inn[j+1]!=inn[i]) j=nextt[j]; 15 j+=(inn[j+1]==inn[i]); 16 nextt[i]=j; 17 } 18 j=0; 19 for(int i=lenn;i;i=nextt[i]) outt[++j]=i; 20 for(int i=j;i>=2;i--) printf("%d ",outt[i]); 21 printf("%d\n",outt[1]); 22 } 23 return 0; 24 }
KMP中next的应用 POJ 2752 Seek the Name, Seek the Fame
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。