HDU 1867 A + B for you again (KMP应用)

Generally speaking, there are a lot of problems about strings processing. Now you encounter another such problem. If you get two strings, such as “asdf” and “sdfg”, the result of the addition between them is “asdfg”, for “sdf” is the tail substring of “asdf” and the head substring of the “sdfg” . However, the result comes as “asdfghjk”, when you have to add “asdf” and “ghjk” and guarantee the shortest string first, then the minimum lexicographic second, the same rules for other additions.

,宁愿停歇在你门前的那棵树上,看着你,守护你。

HDU 1867 A + B for you again (KMP应用)

相关文章:

你感兴趣的文章:

标签云: