Codeforces B. Password （KMP）

最新推荐文章于 2023-08-14 18:12:59 发布

Top_Spirit

最新推荐文章于 2023-08-14 18:12:59 发布

阅读量429

点赞数

CC 4.0 BY-SA版权

分类专栏： KMP 文章标签： acm KMP

本文链接：https://blog.youkuaiyun.com/weixin_41190227/article/details/86513980

本文介绍了ACM题目B. Password的解决方案，重点在于利用KMP算法寻找满足既是字符串s前缀又是后缀的最长子串。通过Next数组分析字符串，解决不符合预期的情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

B. Password

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.

A little later they found a string s, carved on a rock below the temple's gates. Asterix supposed that that's the password that opens the temple and read the string aloud. However, nothing happened. Then Asterix supposed that a password is some substring t of the string s.

Prefix supposed that the substring t is the beginning of the string s; Suffix supposed that the substring t should be the end of the string s; and Obelix supposed that t shoul