最长回文串模版

没看懂没看懂.回文串的问题没有看懂呀...

贴出代码

for (int i = 1; i < cnt * 2 + 2; i++){if (MaxId > i){p[i] = min(p[2 * id - i], MaxId - i);}else{p[i] = 1;}while (str[i + p[i]] == str[i - p[i]]){p[i]++;}if (p[i] + i > MaxId){MaxId = p[i] + i;id = i;}}int pos;for (int i = 2; i < cnt * 2 + 2; i += 2){if (p[i] > MaxL){pos = i;MaxL = p[i];}}printf("pos = %d MaxL = %d", pos, MaxL - 1);