poj2752 Seek the Name, Seek the Fame(next数组的运用)
来源:互联网 发布:淘宝宝贝怎么设置套餐 编辑:程序博客网 时间:2024/05/18 02:14
题目链接:http://poj.org/problem?id=2752
Seek the Name, Seek the Fame
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12018 Accepted: 5906
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
ababcababababcababaaaaa
Sample Output
2 4 9 181 2 3 4 5
Source
POJ Monthly--2006.01.22,Zeyuan Zhu
题意:寻找前子串与后子串相等的子串。
代码如下:
#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>using namespace std;#define MAXN 1000017int next[MAXN];int ans[MAXN];int len;void getnext( char T[]){ int i = 0, j = -1; next[0] = -1; while(i < len) { if(j == -1 || T[i] == T[j]) { i++,j++; next[i] = j; } else j = next[j]; }}int main(){ char ss[MAXN]; int length; while(~scanf("%s",ss)) { len = strlen(ss); getnext(ss);int n = 0 ;int i = len;ans[0]=len;while(next[i] > 0 )//倒着扫描next数组{//递归查找前子串和后子串相等的子串i = next[i];ans[++n] = i ;}for( i = n ; i >= 0 ; i--)printf("%d ",ans[i]);printf("\n"); } return 0;}
1 1
- poj2752 Seek the Name, Seek the Fame(next数组的运用)
- POJ2752 Seek the Name, Seek the Fame next数组应用
- poj2752 Seek the Name, Seek the Fame(next数组的理解)
- POJ2752 Seek the Name, Seek the Fame KMP-next数组的应用
- POJ 2752 Seek the Name, Seek the Fame(KMP+next数组的运用)
- Seek the Name, Seek the Fame next数组的应用
- POJ2752 Seek the Name, Seek the Fame
- POJ2752:Seek the Name, Seek the Fame
- poj2752 Seek the Name, Seek the Fame
- POJ2752 Seek the Name, Seek the Fame
- poj2752 seek the name seek the fame
- poj2752 Seek the Name, Seek the Fame
- POJ2752 Seek the Name, Seek the Fame
- poj2752-Seek the Name, Seek the Fame
- poj2752 Seek the Name,Seek the Fame
- POJ2752 Seek the Name, Seek the Fame
- poj2752 seek the name,seek the fame
- POJ2752 Seek the Name, Seek the Fame
- hdu 4300 Clairewd’s message(详解,扩展KMP)
- 大神F1刷机
- 各种数据结构的存储结构描述
- android,手机防盗笔记。手机imsi,sms。
- 职场分享:在职场中我们需要哪些工作技巧
- poj2752 Seek the Name, Seek the Fame(next数组的运用)
- 在新公司的两个月
- uva live 6479
- 你知道C/S和B/S两种架构有什么区别吗?
- linux 重启服务命令
- PHP在代码中屏蔽错误和警告
- hdu4932 Miaomiao's Geometry (BestCoder Round #4 枚举)
- Java 欧拉工程 第二十六篇【 小于1000的数字中令1/d拥有最长循环圈的数字d】
- 操作系统相关