Monster_Qi

摘要： "传送门" 解题思路 最长回文子串。首先把串倒过来接到原串之后，中间要加一个特殊字符。然后枚举一下回文的位置，算一下前面和后面的$lcp$即可。 代码 cpp include include include include include using namespace std; const int 阅读全文