【后缀数组】poj2406 Power Strings

【【后缀数组】poj2406 Power Strings】的更多相关文章

POJ2406 Power Strings —— KMP or 后缀数组最小循环节

题目链接:https://vjudge.net/problem/POJ-2406 Power Strings Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 52631 Accepted: 21921 Description Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc"…

poj2406 Power Strings（kmp）

poj2406 Power Strings(kmp) 给出一个字符串,问这个字符串是一个字符串重复几次.要求最大化重复次数. 若当前字符串为S,用kmp匹配'\0'+S和S即可. #include <cstdio> #include <cstring> using namespace std; const int maxn=2e6+5; char s1[maxn], s2[maxn]; int n1, n2, nxt[maxn], ans; int main(){ while (~…

POJ2406 Power Strings(KMP,后缀数组)

这题可以用后缀数组,KMP方法做后缀数组做法开始想不出来,看的题解,方法是枚举串长len的约数k,看lcp(suffix(0), suffix(k))的长度是否为n- k ,若为真则len / k即为结果. 若lcp(suffix(0), suffix(k))的长度为n- k,则将串每k位分成一段,则第1段与第2段可匹配,又可推得第2段与第3段可匹配……一直递归下去,可知每k位都是相同的,画图可看出匹配过程类似于蛇形. 用倍增算法超时,用dc3算法2.5秒勉强过. #include<cstdi…

POJ2406 Power Strings 【KMP 或后缀数组】

电源串时间限制: 3000MS 内存限制: 65536K 提交总数: 53037 接受: 22108 描述给定两个字符串a和b,我们定义a * b是它们的连接.例如,如果a ="abc"和b ="def",那么a * b ="abcdef".如果我们将连接看作是乘法,则用正常的方式定义非负整数的指数:a ^ 0 =""(空字符串)和a ^(n + 1)= a *(a ^ n). 输入每个测试用例都是一行代表s的输…

poj2406 Power Strings (kmp 求最小循环字串)

Power Strings Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 47748 Accepted: 19902 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 = &quo…

poj2406 Power Strings（kmp失配函数）

Power Strings Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 39291 Accepted: 16315 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 = "abcd…