Power String POJ-2406 字符串压缩模板题,但是是求有多少个这样最短的子串可以组成s. #include<iostream> #include<cstring> #include<cstdio> #include<string> #include<algorithm> using namespace std; const int N=10000001; int pi[N]; void Pi(string s){ memset(p…

题目链接:http://poj.org/problem?id=2406 题意:给定一个字符串,求由一个子串循环n次后可得到原串,输出n[即输出字符串的最大循环次数] 思路一:KMP求最小循环机,然后就能求出循环次数. #define _CRT_SECURE_NO_DEPRECATE #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<str…

Language: Default Power Strings Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 33205   Accepted: 13804 Description Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def"…

题目链接:https://vjudge.net/problem/POJ-2406 kmp学习:https://blog.csdn.net/starstar1992/article/details/54913261/ 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 = "abc…

给一个字符串.求这个串的最小的循环节的长度. 好像.num = len/(len-next[len]) 就是循环节的长度.如果 len%(len-next[len]) ==0 就是 说字符串长度刚好是循环节长度的整数倍.不然的话.说明没有最小循环节. 证明嘛.这里好像还是蛮靠谱的.http://blog.csdn.net/euler_m/article/details/6281903 但是..还是没有看懂..~~~~(>_<)~~~~暂且记住吧,, 附代码: #include<stdio…

题意:让你找最小重复串的个数 加深KMP中对next数组的理解 #include <cstdio> #include <cstring> using namespace std; int next[1000500],slen; char s[1000500]; void get_next(){ int i=1,j=0; next[1]=0; while(i<=slen){ if(j==0||s[i]==s[j]) next[++i]=++j; else j=next[j];…

Sample Input abcdaaaaababab.Sample Output 1 //1个abcd4 //4个a3 //3个ab #include<stdio.h> #include<iostream> #include<string.h> #include<algorithm> using namespace std; ; char T[MAXN]; int next[MAXN]; int n; void getNext() { int j,k; j…

题目传送门 /* 题意:一个串有字串重复n次产生,求最大的n KMP:nex[]的性质应用,感觉对nex加深了理解 */ /************************************************ * Author :Running_Time * Created Time :2015-8-10 10:51:54 * File Name :POJ_2406.cpp ************************************************/ #incl…

Period HDOJ-1358 这题还是属于KMP算法的应用,属于字符串压缩问题.也就是在一个字符串s中寻找一个前缀,使得s可以被一份或者多份前缀子串t拷贝连接,也就是串接. #include<iostream> #include<cstdio> #include<cstring> #include<string> #include<algorithm> using namespace std; int n; string a; int pi[…

Power Strings POJ - 2406 时限: 3000MS   内存: 65536KB   64位IO格式: %I64d & %I64u 提交 状态 已开启划词翻译 问题描述 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".…