蜡笔小新冲鸭！！！

题目链接：https://vjudge.net/problem/HDU-6153 题意：给两个字符串s和t，求t的每个后缀的长度乘以它在s中出现的次数之和。 用了扩展KMP的板子，因为扩展KMP求出的extend[i]extend[i]表示的是ss的ii到strlen(s)−1strlen(s)−1字符和tt的最长公共前缀。题目中要求后缀，就将两个字符串reverse一下。这样的话，extend[...

题目链接：https://vjudge.net/problem/HDU-3613 After an uphill battle, General Li won a great victory. Now the head of state decide to reward him with honor and treasures for his great exploit. One of these...