poj 2752
来源:互联网 发布:苹果数据线线序 编辑:程序博客网 时间:2024/06/13 02:02
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:)
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.
For each test case, output a single line with integer numbers in increasing order, denoting the possible length of the new baby's name.
ababcababababcababaaaaa
2 4 9 181 2 3 4 5
题意概况:简单点说就是找出所给字符串的所有相同的前缀后缀长度。
解题思路:根据题意可以知道最长的相同前缀后缀就是字符串本身,以题中样例ababcababababcabab为例,最大前缀后缀是18,而next[18]=9;也就是说字符串整体的 真 前后缀长度是9,字符串的前9个字符和后9个字符完全一致。现在要找的是比18小的相同前后缀,因为前后两段9个字符串完全一致,那么整体的字符串里面的前后缀和这9个字符串的前后缀是完全一致的,ababcababababcabab小于18的前后缀是ababcabab ababcabab,而这9个字符ababcabab的前后缀也是一样的。所有再找到整体的前后缀时,可以直接去找前next[i]个字符串的前后缀。
代码:
#include<stdio.h>#include<string.h>int next[405000];int d[405000];void GetNext(char p[]){int i=0;int j=-1;next[0]=-1;int l=strlen(p);while(i<l){if(j==-1||p[i]==p[j]){i++;j++;next[i]=j;}else{j=next[j];}}/*for(i=0;i<=l;i++){printf("%d ",next[i]);}printf("\n");*/}void KMP(char s[]){GetNext(s);memset(d,0,sizeof(d));int l1=strlen(s);int i=l1;int t=0;while(i<=l1){d[t]=i;t++;if(next[i]==0)//必须先判断next[i]是否为0,才能接着找break;i=next[i];}for(i=t-1;i>=0;i--){printf("%d ",d[i]);}printf("\n");}int main(){char s[405000],p[405000];while(gets(s)!=NULL){KMP(s);}}
阅读全文
0 0
- POJ 2752
- poj 2752
- poj 2752
- POJ 2752
- poj 2752
- POJ 2752
- poj(2752)
- POJ 2752
- poj 2752
- POJ 2752
- poj 2752
- POJ-2752
- POJ 2752
- POJ-2752
- poj 2752
- Poj 2752
- poj 2752
- POJ 2752
- Spring MVC的使用
- ajax请求异步
- 函数指针
- javascript学习(十五)— 创建对象
- Python入门6_抽象
- poj 2752
- CSS Flex 布局教程
- 基于黑盒测试的代码覆盖率的实现
- oracle_sqlplus -variable、define..
- 后缀数组 (入门模板)
- ASP.NET权限管理(一)
- ccui.pageView基础应用
- C++ 单链表基本操作分析与实现 链表 链表是一种物理存储单元上非连续、非顺序的存储结构,数据元素的逻辑顺序是通过链表中的指针链接次序实现的。链表由一系列结点(链表中每一个元素称为结点)组成,结
- 任务调度(Quartz Enterprise Job Scheduler)