POJ 2406 Power Strings 数据结构+KMP
来源:互联网 发布:怎样在淘宝上注册网店 编辑:程序博客网 时间:2024/06/05 14:42
Power Strings
Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluDescription
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.
解题思路:
一看就知道考的是kmp的失配函数/next数组的含义
看最后一个字符的f[i] 如果n%(n-f[n])!=0那就是不循环的
否则循环节就是n/(n-f[n])
面对这种题,只要自己对失配函数和next理解到一定程度,基本不用太多思考
解题思路:
一看就知道考的是kmp的失配函数/next数组的含义
看最后一个字符的f[i] 如果n%(n-f[n])!=0那就是不循环的
否则循环节就是n/(n-f[n])
面对这种题,只要自己对失配函数和next理解到一定程度,基本不用太多思考
#include<cstdio>#include<cstring>#include<iostream>using namespace std;const int maxn = 1000005 ;char str[maxn] ;int f[maxn] ;void getfail(){ f[0] = 0 ; f[1] = 0 ; int n = strlen(str); for(int i=1;i<n;i++){ int j = f[i] ; while(j&&str[i]!=str[j])j = f[j] ; f[i+1] = (str[i]==str[j]?j+1:0) ; } return ;}int main(){ while(~scanf("%s",str)){ if(str[0]=='.')break ; getfail();// for(int i=0;i<=strlen(str);i++){// printf("%d ",f[i]);// }printf("\n"); int n = strlen(str) ; int t = n-f[n]; if(n%t==0){ printf("%d\n",n/t); }else{ printf("1\n"); } } return 0;}
0 0
- poj 2406 Power Strings(数据结构:KMP||暴力)
- poj 2406 : acm 数据结构Power Strings (KMP)
- POJ 2406 Power Strings 数据结构+KMP
- poj 2406 Power Strings---kmp
- POJ 2406 Power Strings KMP
- poj-2406-Power Strings-kmp
- POJ-2406 Power Strings KMP
- Power Strings - POJ 2406 KMP
- poj 2406 Power Strings kmp
- POJ 2406-Power Strings (KMP)
- 【KMP】 POJ 2406 Power Strings
- poj 2406 Power Strings KMP
- POJ 2406 Power Strings KMP
- poj 2406 Power Strings KMP
- poj 2406 Power Strings (KMP)
- [2406]Power Strings (POJ) KMP
- Power Strings (poj 2406 KMP)
- poj 2406 Power Strings【KMP】
- ACM国内外OJ网站大集合
- Java 中的成员内部类
- javascript针对DOM的应用
- 【VS开发】 自己编写一个简单的ActiveX控件——详尽教程
- apache配置多网站
- POJ 2406 Power Strings 数据结构+KMP
- virtualbox异常处理
- memcache 的内存管理介绍和 php实现memcache一致性哈希分布式算法
- Java类初始化
- DP练习 - 奶牛的锻炼
- vector::clear ,vector::crbegin (c++11),vector::crend(c++11)
- 约瑟夫环问题
- JAVA:自定义注解
- sqlite 版本升级及数据库操作类(二)