poj_2752_kmp_nxt_application_求s 所有子串是s的前缀又是后缀的长度
2017-09-23 22:09
615 查看
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:)
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.
For each test case, output a single line with integer numbers in increasing order, denoting the possible length of the new baby's name.
题意:
给你字符串s ,让你求所有子串即使s的前缀又是后缀的长度,从小到大输出
解;
盗图:
如左图,假设黑色线来代表字符串str,其长度是len,红色线的长度代表next[len],根据next数组定义易得前缀的next[len]长度的子串和后缀next[len]长度的子串完全相同(也就是两条线所对应的位置)。我们再求出next[len]位置处的next值,也就是图中蓝线对应的长度。同样可以得到两个蓝线对应的子串肯定完全相同,又由于第二段蓝线属于左侧红线的后缀,所以又能得到它肯定也是整个字符串的后缀。 所以对于这道题,求出len处的next值,并递归的向下求出所有的next值,得到的就是答案。
#include<iostream>
#include<cstdio>
#include<stack>
#include<cstring>
using namespace std;
const int N=(int)4e5+10;
int nxt
,m;
void get(char *s)
{
int i=0,j=-1;
nxt[0]=-1;
while(i<m)
{
if(j==-1||s[i]==s[j])
nxt[++i]=++j;
else
j=nxt[j];
}
}
char s
;
int main()
{
while(cin>>s)
{
m=strlen(s);
get(s);
stack<int > q;
while(!q.empty()) { q.pop();}
q.push(m);
int j=m;
while(j)
{
q.push(nxt[j]);
j=nxt[j];
}
while(!q.empty())
{
int tt=q.top();
if(tt)
cout<<tt<<" ";
q.pop();
}
puts("");
}
return 0;
}
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 181 2 3 4 5
题意:
给你字符串s ,让你求所有子串即使s的前缀又是后缀的长度,从小到大输出
解;
盗图:
如左图,假设黑色线来代表字符串str,其长度是len,红色线的长度代表next[len],根据next数组定义易得前缀的next[len]长度的子串和后缀next[len]长度的子串完全相同(也就是两条线所对应的位置)。我们再求出next[len]位置处的next值,也就是图中蓝线对应的长度。同样可以得到两个蓝线对应的子串肯定完全相同,又由于第二段蓝线属于左侧红线的后缀,所以又能得到它肯定也是整个字符串的后缀。 所以对于这道题,求出len处的next值,并递归的向下求出所有的next值,得到的就是答案。
#include<iostream>
#include<cstdio>
#include<stack>
#include<cstring>
using namespace std;
const int N=(int)4e5+10;
int nxt
,m;
void get(char *s)
{
int i=0,j=-1;
nxt[0]=-1;
while(i<m)
{
if(j==-1||s[i]==s[j])
nxt[++i]=++j;
else
j=nxt[j];
}
}
char s
;
int main()
{
while(cin>>s)
{
m=strlen(s);
get(s);
stack<int > q;
while(!q.empty()) { q.pop();}
q.push(m);
int j=m;
while(j)
{
q.push(nxt[j]);
j=nxt[j];
}
while(!q.empty())
{
int tt=q.top();
if(tt)
cout<<tt<<" ";
q.pop();
}
puts("");
}
return 0;
}
相关文章推荐
- poj 2752 Seek the Name, Seek the Fame 【在原串中 找所有既是原串前缀又是原串后缀的子串长度】
- POJ 2752 Seek the Name, Seek the Fame(求所有既是前缀又是后缀的子串长度)
- POJ 2752 (KMP 所有可能长度的前缀后缀) Seek the Name, Seek the Fame
- POJ 2752 Seek the Name, Seek the Fame (KMP的next函数,求前缀和后缀的匹配长度)
- POJ 2752 既是前缀又是后缀的子串 (kmp)
- 【kmp+求所有公共前后缀长度】poj 2752 Seek the Name, Seek the Fame
- POJ 2752 既是前缀又是后缀的子串 (kmp)
- POJ 2752+KMP+利用next数组性质求出所有相同的前缀和后缀
- 【Kmp求既是前缀又是后缀的子串】POJ - 2752 Seek the Name, Seek the Fame
- poj 2752 (找既是前缀又是后缀的串的长度)kmp/拓展kmp
- POJ 2752 -kmp求所有公共前后缀长度
- poj_2752 Seek the Name, Seek the Fame(KMP:寻找所有公共前缀后缀)
- POJ - 2752 - Seek the Name, Seek the Fame (KMP-打印前缀后缀长度)
- poj 2752 Seek the Name, Seek the Fame(找出所有前缀等于后缀的位置)
- POJ2752 Seek the Name, Seek the Fame 【既是前缀又是后缀的子串】
- poj 2752 Seek the Name, Seek the Fame【KMP算法分析记录】【求前后缀相同的子串的长度】
- POJ - 2752 Seek the Name, Seek the Fame(KMP中对next数组的前缀后缀匹配应用)
- POJ 2752 Seek the Name, Seekthe Fame(KMP:后缀与前缀)
- POJ 1699 Best Sequence (TSP之dp状态压缩+KMP计算主串前缀匹配子串后缀)
- POJ 2752 Seek the Name, Seek the Fame kmp(后缀与前缀)