Codeforces 700E Cool Slogans 后缀数组+线段树

最新推荐文章于 2020-01-17 08:43:09 发布

VampireWeekend

最新推荐文章于 2020-01-17 08:43:09 发布

阅读量930

点赞数 1

分类专栏： =======字符串======= 后缀数组线段树

本文链接：https://blog.csdn.net/sinat_35406909/article/details/78445397

版权

公司名称为w，求最长的标语序列s1, s2, ..., sk，满足任意标语比前一个更酷，即在前一个标语中至少出现两次。题目通过后缀数组和线段树解决，构建以好子串为节点的树，并找到该树的最大深度。" 121101287,10964290,Aeron空闲策略详解：选择指南,"['开发工具', 'Aeron', '并发编程', '性能优化']

摘要由CSDN通过智能技术生成

E. Cool Slogans

time limit per test

4 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Bomboslav set up a branding agency and now helps companies to create new logos and advertising slogans. In term of this problems, slogan of the company should be a non-empty substring of its name. For example, if the company name is "hornsandhoofs", then substrings "sand" and "hor" could be its slogans, while strings "e" and "hornss" can not.

Sometimes the company performs rebranding and changes its slogan. Slogan A is considered to be coolerthan slogan B if B appears in A as a substring at least twice (this occurrences are allowed to overlap). For example, slogan A = "abacaba" is cooler than slogan B = "ba", slogan A = "abcbcbe" is cooler than slogan B = "bcb", but slogan A = "aaaaaa" is not cooler than slogan B = "aba".