POJ2406 Power Strings(KMP next数组的运用)
2015-06-02 11:38
435 查看
Power Strings
Description
Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: a^0 = "" (the
empty string) and a^(n+1) = a*(a^n).
Input
Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case.
Output
For each s you should print the largest n such that s = a^n for some string a.
Sample Input
Sample Output
Hint
This problem has huge input, use scanf instead of cin to avoid time limit exceed.
与模式串第n-next
位到n位是匹配的。
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 36160 | Accepted: 14929 |
Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: a^0 = "" (the
empty string) and a^(n+1) = a*(a^n).
Input
Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case.
Output
For each s you should print the largest n such that s = a^n for some string a.
Sample Input
abcd aaaa ababab .
Sample Output
1 4 3
Hint
This problem has huge input, use scanf instead of cin to avoid time limit exceed.
题目大意:
给定一个串,求能分成几个相等的子串。解题思路:
利用求KMP next数组的方法,next表示模式串如果第i位(设p[0]为第0位)与文本串第j位不匹配则要回到第next[i]位继续与文本串第j位匹配。则模式串第1位到next与模式串第n-next
位到n位是匹配的。
AC代码:
#include<iostream> #include<cstring> #include<string> using namespace std; const int maxn = 1000001; int next[maxn]; int Compute_next(string p) { int len = p.length(); memset(next,0,sizeof(next)); next[0] = -1; //没有公共前后缀 int i = 0,j = -1; //i为母串当前匹配的位置,j为子串当前匹配位置 while(i <= len) { if(j == -1 || p[i] == p[j]) { i++; //匹配两个指针都往后移 j++; next[i] = j; //记录next数组,表示p[1...j]与p[i-j+1..i]是完全相等的 } else { j = next[j]; //如果不匹配,就回退到j位置 } } int x = len - next[len]; //已匹配的串位置 if(len % x == 0 && x != 0) { return x; } else { return len; } } int main() { string a; while(cin>>a) { int len = a.length(); if(a[0] == '.') { break; } else { int res = Compute_next(a); cout<<len / res <<endl; } } return 0; }
相关文章推荐
- JAVA 、WebService 必须懂的 NotePad 工具小窍门
- JAVA代码实现下载单个文件,和下载打包文件
- LeetCode_7---Reverse Integer
- 深入理解Java Class文件格式(三)
- Cocos2dx 3.0 -- lambda表达式的使用
- 常见六种热量高食物和饮料
- QT license gen tool开发总结
- 什么是低耦合和高聚合?封装原则又是什么意思?
- Eclipse上无法用debug
- 深入理解Java Class文件格式(二)
- NOI 2012 题解
- JSON 之JAVA 解析
- DbContextConfiguration 属性
- 点击上一个为上一张图片,点击下一个为下一张图片
- uva 1210
- leetcode_54题——Spiral Matrix(数组)
- 深入理解Java Class文件格式(一)
- CentOS 搭建hadhoop单机模式
- SChema 多个属性的设置学习
- YII excel导入