kuangbin KMP E题
来源:互联网 发布:sql 查询过期时间 编辑:程序博客网 时间:2024/06/01 21:46
Problem Description
For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i <= N) we want to know the largest K > 1 (if there is one) such that the prefix of S with length i can be written as AK , that is A concatenated K times, for some string A. Of course, we also want to know the period K.
Input
The input file consists of several test cases. Each test case consists of two lines. The first one contains N (2 <= N <= 1 000 000) – the size of the string S. The second line contains the string S. The input file ends with a line, having the number zero on it.
Output
For each test case, output “Test case #” and the consecutive test case number on a single line; then, for each prefix with length i that has a period K > 1, output the prefix size i and the period K separated by a single space; the prefix sizes must be in increasing order. Print a blank line after each test case.
Sample Input
3
aaa
12
aabaabaabaab
0
Sample Output
Test case #1
2 2
3 3
Test case #2
2 2
6 2
9 3
12 4
题解:
还是Next数组的妙用啊。
注意k必须大于1,英语还需要加强,看题看了好久。
代码:
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>using namespace std;const int MAXN = 1e6 + 10;char str[MAXN];int len;int nt[MAXN];void getNext(){ nt[0] = -1; int i = 0, j = -1; while (i <= len) { if (j == -1 || str[i] == str[j]) { nt[++i] = ++j; } else { j = nt[j]; } }}int main(){ int ks=1; while(cin>>len&&len) { scanf("%s",str); getNext(); //cout<<str<<endl; printf("Test case #%d\n",ks++); for(int i=2;i<=len;i++) { int t = i-nt[i];//求最小循环节 if(i%t==0&&i/t>1) { printf("%d %d\n",i,i/t); } } printf("\n"); } return 0;}
- kuangbin KMP E题
- kuangbin kmp B题
- kuangbin KMP D题
- kuangbin KMP G题
- kuangbin KMP H题
- kuangbin 数论 E题
- [kuangbin带你飞]专题十六 KMP & 扩展KMP & Manacher E HDU 1358
- kuangbin 简单搜索 E
- kuangbin kmp专题中的字符串暴力
- hdu 1711 kuangbin 字符串 A KMP入门
- [kuangbin带你飞]专题十六 KMP & 扩展KMP
- CodeForeces 25E (kmp)
- kuangbin 数论 A题
- [kuangbin带你飞]专题十六 KMP & 扩展KMP & Manacher J (kmp扩展)
- [kuangbin带你飞]专题十六 KMP & 扩展KMP & Manacher K (kmp扩展)
- [kuangbin带你飞]专题十六 KMP & 扩展KMP & Manacher L(kmp扩展)
- kuangbin——线段树专题 E - Just a Hook
- [kuangbin带你飞]专题一 简单搜索 E POJ1426
- Maven+mybatis+mysql项目实践(附demo)
- git命令之git fetch的用法
- Cache在Driver中的使用简介
- Flash erase/program 检查方法
- 计蒜客 query on a string
- kuangbin KMP E题
- UrJTAG 使用和扩展
- Test5
- java线程同步机制以及对象锁机制
- 使用RecyclerView实现ListView,GridView的效果(上下,左右滑动),拖拽与滑动删除
- 思维导图的三招十八式之梳理
- linux文件描述符限制和单机最大长连接数
- Android 不锁屏
- NoSuchMethodError