POJ 2406 Power Strings (KMP next数组应用)
来源:互联网 发布:json入门 编辑:程序博客网 时间:2024/06/05 06:32
Power Strings
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 30862 Accepted: 12864
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
abcdaaaaababab.
Sample Output
143
Hint
This problem has huge input, use scanf instead of cin to avoid time limit exceed.
解决这道题的关键,得先学这个定理:
定理:假设S的长度为len,则S存在循环子串,当且仅当,len可以被len - next[len]整除,最短循环子串为S[len - next[len]]
例子证明:
设S=q1q2q3q4q5q6q7q8,并设next[8] = 6,此时str = S[len - next[len]] = q1q2,由字符串特征向量next的定义可知,q1q2q3q4q5q6 = q3q4q5q6q7q8,即有q1q2=q3q4,q3q4=q5q6,q5q6=q7q8,即q1q2为循环子串,且易知为最短循环子串。由以上过程可知,若len可以被len - next[len]整除,则S存在循环子串,否则不存在。
解法:利用KMP算法求出next数组,然后判断:如果串的长度len可以被你len-next [len]整除,
输出len/(len-next[len]);否则,输出1。
AC代码:
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <set>#include <map>#include <string>#include <math.h>#include <stdlib.h>#include <time.h>#define INF 0x7fffffffusing namespace std;int next[1000005];void getnext(string p,int *next) //next数组的求法{ int m=p.size(); int i=0,j=-1; next[0]=-1; while(i<m) { if(j==-1 || p[i]==p[j]) { i++; j++; next[i]=p[i]!=p[j]?j:next[j]; } else j=next[j]; }}int main(){ string s; while(cin>>s && s[0]!='.') { memset(next,0,sizeof(next)); int l=s.size(); getnext(s,next); if(l%(l-next[l])==0) cout<<l/(l-next[l])<<endl; else cout<<1<<endl; } return 0;}
0 0
- POJ 2406 Power Strings (KMP next数组应用)
- poj 2406 Power Strings(kmp next数组的应用)
- poj 2406 Power Strings KMP的next数组的应用
- poj 2406 Power Strings kmp next数组
- POJ 2406 Power Strings (kmp next数组)
- 【next数组应用】POJ 2406 Power Strings
- POJ-Power Strings(next数组应用)
- POJ 2046 Power Strings KMP(next数组应用)
- POJ 2406 Power Strings(next数组应用)
- POJ 2406 Power Strings KMP中next数组简单运用
- Power Strings POJ 2406【KMP Next的应用】
- POJ 2406-Power Strings(重复子串-KMP中的next数组)
- 【POJ2406】Power Strings-KMP中next数组的应用
- Power Strings next数组应用
- POJ 2406 Power Strings 【后缀数组||KMP】
- POJ 2406 Power Strings(KMP的应用)
- poj 2406 Power Strings KMP应用
- poj 2406 Power Strings 【KMP的应用】
- 前正试图将类Kinect功能添加到未来Windows Phone
- hibernate sessionFactory是做什么的,一级缓存二级缓存都是干什么的
- 统治世界的十大算法
- jedis +springdata spring-data-redis 1.1.1 to 1.2.0 afterPropertiesSet signature exception
- Dubbo学习教程实例
- POJ 2406 Power Strings (KMP next数组应用)
- 不用打开Safari,直接进入App Store
- Hadoop生物圈
- epoll select poll
- Arch Linux最小化安装LXDE桌面环境
- 数据结构课程设计--思维导图
- android中Gson解析
- code force 10D dp 最长公共上升子序列
- 【进程间通信】信号