Seek the Name, Seek the Fame
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 21947 | Accepted: 11481 |
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题意:给定字符串,要求从小到大输出既是前缀又是后缀的串的位置
思路:求出next数组,next数组中存的是每个位置的最长相同前缀后缀,不断向前递归输出即可
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <cstring>
#include <queue>
#include <algorithm>
#define ll long long
#define max_ 1010000
#define les 1e-6
#define inf 0x3f3f3f3f
using namespace std;
int f[max_];
char s[max_];
int flag;
void p(int x)
{
if(f[x]==-1)
return;
p(f[x]);
printf("%d ",f[x]+1);
}
int main(int argc, char const *argv[]) {
while(scanf(" %s",s)!=EOF)
{
int l=strlen(s);
f[0]=-1;
for(int i=1;i<l;i++)
{
int j=f[i-1];
while(j>=0&&s[i]!=s[j+1])
j=f[j];
if(s[i]==s[j+1])
f[i]=j+1;
else
f[i]=-1;
}
flag=0;
p(l-1);
printf("%d\n",l);
}
return 0;
}