KMP + 求最小循环节 --- POJ 2406 Power Strings
来源:互联网 发布:淘宝手机端首页装修 编辑:程序博客网 时间:2024/05/16 14:21
Power Strings
Problem's Link: http://poj.org/problem?id=2406
Mean:
给你一个字符串,让你求这个字符串最多能够被表示成最小循环节重复多少次得到。
analyse:
KMP之next数组的运用。裸的求最小循环节。
Time complexity: O(N)
Source code:
/*
* this code is made by crazyacking
* Verdict: Accepted
* Submission Date: 2015-07-28-08.23
* Time: 0MS
* Memory: 137KB
*/
#include <queue>
#include <cstdio>
#include <set>
#include <string>
#include <stack>
#include <cmath>
#include <climits>
#include <map>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#define LL long long
#define ULL unsigned long long
using namespace std;
const int MAXN=1000010;
char s[MAXN];
int Next[MAXN];
void getNext(int len)
{
Next[0]=0;
for(int i=1,k=0;i<len;++i)
{
while(s[i]!=s[k] && k) k=Next[k-1];
if(s[i]==s[k]) ++k;
Next[i]=k;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
while(~scanf("%s",s) && s[0]!='.')
{
int len=strlen(s);
getNext(len);
int min_cycle=len-Next[len-1];
if(len%min_cycle!=0) printf("1\n");
else printf("%d\n",len/min_cycle);
}
return 0;
}
/*
*/
* this code is made by crazyacking
* Verdict: Accepted
* Submission Date: 2015-07-28-08.23
* Time: 0MS
* Memory: 137KB
*/
#include <queue>
#include <cstdio>
#include <set>
#include <string>
#include <stack>
#include <cmath>
#include <climits>
#include <map>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#define LL long long
#define ULL unsigned long long
using namespace std;
const int MAXN=1000010;
char s[MAXN];
int Next[MAXN];
void getNext(int len)
{
Next[0]=0;
for(int i=1,k=0;i<len;++i)
{
while(s[i]!=s[k] && k) k=Next[k-1];
if(s[i]==s[k]) ++k;
Next[i]=k;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
while(~scanf("%s",s) && s[0]!='.')
{
int len=strlen(s);
getNext(len);
int min_cycle=len-Next[len-1];
if(len%min_cycle!=0) printf("1\n");
else printf("%d\n",len/min_cycle);
}
return 0;
}
/*
*/
0 0
- 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)
- poj 2406 Power Strings (KMP+最小循环节)
- POJ 2406 Power Strings(KMP+最小循环节)
- 【POJ 2406】 Power Strings(KMP求循环节)
- POJ 2406Power 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循环节)
- poj 2406 Power Strings【kmp循环节】
- poj2406--Power Strings(KMP求最小循环节)
- 模板题 + KMP + 求最小循环节 --- HDU 3746 Cyclic Nacklace
- 菜鸟vimer成长记——第2.1章、normal模式
- 菜鸟vimer成长记——第2.2章、visual模式
- KMP + 求最小循环节 --- HDU 1358 Period
- KMP + 求最小循环节 --- HUST 1010
- KMP + 求最小循环节 --- POJ 2406 Power Strings
- KMP + 求相等前后缀--- POJ Seek the Name, Seek the Fame
- “练习一万小时”定律
- Java动态代理机制详解(JDK 和CGLIB,Javassist,ASM)
- 2015 Multi-University Training Contest 3 1002 RGCDQ
- 2015 Multi-University Training Contest 3 1001 Magician
- view、surfaceview、GLsurfaceview的区别和应用场景
- 2015 Multi-University Training Contest 3 1006 Beautiful Set
- 深入.NET第九章 小型资源管理器