这是一道关于字符串压缩的问题，Amugae希望将一个由n个单词组成的句子压缩成一个单词，压缩规则是：每次合并两个相邻单词时，移除第二个单词的最长前缀，该前缀与第一个单词的后缀相同。题目要求编写程序输出压缩后的单词。给定n个单词，需要找出压缩过程结束后的单词长度。解决方案提到可以使用哈希技巧，通过暴力枚举后缀长度来求解，时间复杂度为所有单词长度之和。
time limit per test : 1 second
memory limit per test : 256 megabytes
分数：2000，但是我觉得这个题挺神的。
Amugae has a sentence consisting of n n n words. He want to compress this sentence into one word. Amugae doesn’t like repetitions, so when he merges two words into one word, he removes the longest prefix of the second word that coincides with a suffix of the first word. For example, he merges “sample” and “please” into “samplease”.
Amugae will merge his sentence left to right (i.e. first merge the first two words, then merge the result with the third word and so on). Write a program that prints the compressed word after the merging process ends.
Input
The first line contains an integer n ( 1 ≤ n ≤ 1 0 5 ) n(1≤n≤10^5) n(1≤n≤105), the number of the words in Amugae’s sentence.
The second line contains n n n words separated by single space. Each words is non-empty and consists of uppercase and lowercase English letters and digits ( ′ A ′ , ′ B ′ , . . . , ′ Z ′ , ′ a ′ , ′ b ′ , . . . , ′ z ′ , ′ 0 ′ , ′ 1 ′ , .
最低0.47元/天 解锁文章
扫一扫
214
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
