[HDU 5510][2015ACM/ICPC 亚洲区沈阳站]　Bazinga　KMP+剪支

最新推荐文章于 2020-07-04 22:09:41 发布

ALPS233

最新推荐文章于 2020-07-04 22:09:41 发布

阅读量3.8k

点赞数 1

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

本文链接：https://blog.csdn.net/ALPS233/article/details/51197669

版权

该博客介绍了ACM/ICPC亚洲区沈阳站的一个字符串问题，要求找到下标最大的字符串，使得所有下标小于它的字符串中不存在它的子串。提出了利用KMP算法结合剪枝策略来优化求解方法，避免了平方级别的复杂度。给出了问题的输入输出示例，并提供了问题背景和解题思路。

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

Bazinga
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1597 Accepted Submission(s): 499

Problem Description
Ladies and gentlemen, please sit up straight.
Don’t tilt your head. I’m serious.

A substring of a string Si is another string that occurs in Si. For example, ruiz" is a substring ofruizhang”, and rzhang" is not a substring ofruizhang”.

Input
The first line contains an integer t (1≤t≤50) which is the number of test cases.
For each test case, the first line is the positive integer n (1≤n≤500) and in the following n lines list are the strings S1,S2,⋯,Sn.
All strings are given in lower-case letters and strings are no longer than 2000 letters.

Output
For each test case, output the largest label you get. If it does not exist, output −1.

Sample Input

4
5
ab
abc
zabc
abcd
zabcd
4
you
lovinyou
aboutlovinyou
allaboutlovinyou
5
de
def
abcd
abcde
abcdef
3
a
ba
ccc