poj2752 Seek the Name, Seek the Fame(next数组的运用)
2015-12-29 14:28
330 查看
题目链接:http://poj.org/problem?id=2752
Seek the Name, Seek the Fame
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:)
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
Sample Output
Source
POJ Monthly--2006.01.22,Zeyuan Zhu
题意:寻找前子串与后子串相等的子串。
代码例如以下:
Seek the Name, Seek the Fame
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 12018 | Accepted: 5906 |
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:)
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 18 1 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 1000017 int 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; }
相关文章推荐
- 日历插件简单汉化—datepicker类型
- windows修改输入法快捷键为ctrl+space
- 排序算法—快速排序算法分析与实现(Python)
- 不得不说的for循环
- 3D空间包围球(Bounding Sphere)的求法
- Shell for循环
- VS2010打开项目提示未能正确加载解决方案中一个或多个项目
- ubuntu和WIN7双系统启动异常,使用grub修复
- oc_对象的深拷贝与浅拷贝区别详解
- Angular中Directive总结
- rhel6配置vsftpd(debian8很简单)
- JIRA Plugin: User 'admin' exists but has no unique key mapping
- Android中Adapter的notifyDataSetInvalidated()和notifyDataSetChanged()的区别
- 今日的杂记
- Linux下 SVN 安装
- SQL查询表,表的所有字段名
- json对象
- C++小题(五)
- SQLSERVER SQL性能优化
- Shell case esac语句