CodeForces17E- Palisection（manacher）

Description
In an English class Nick had nothing to do at all, and remembered about wonderful strings called palindromes. We should remind you that a string is called a palindrome if it can be read the same way both from left to right and from right to left. Here are examples of such strings: «eye», «pop», «level», «aba», «deed», «racecar», «rotor», «madam».
Nick started to look carefully for all palindromes in the text that they were reading in the class. For each occurrence of each palindrome in the text he wrote a pair — the position of the beginning and the position of the ending of this occurrence in the text. Nick called each occurrence of each palindrome he found in the text subpalindrome. When he found all the subpalindromes, he decided to find out how many different pairs among these subpalindromes cross. Two subpalindromes cross if they cover common positions in the text. No palindrome can cross itself.
Let’s look at the actions, performed by Nick, by the example of text «babb». At first he wrote out all subpalindromes:
• « b» — 1…1
• « bab» — 1…3
• « a» — 2…2
• « b» — 3…3
• « bb» — 3…4
• « b» — 4…4
Then Nick counted the amount of different pairs among these subpalindromes that cross. These pairs were six:

1. 1…1 cross with 1…3
2. 1…3 cross with 2…2
3. 1…3 cross with 3…3
4. 1…3 cross with 3…4
5. 3…3 cross with 3…4
6. 3…4 cross with 4…4
   Since it’s very exhausting to perform all the described actions manually, Nick asked you to help him and write a program that can find out the amount of different subpalindrome pairs that cross. Two subpalindrome pairs are regarded as different if one of the pairs contains a subpalindrome that the other does not.

Input
The first input line contains integer n (1 ≤ n ≤ 2·10^6) — length of the text. The following line contains n lower-case Latin letters (from a to z).

Output
In the only line output the amount of different pairs of two subpalindromes that cross each other. Output the answer modulo 51123987.

Examples
Input
4
babb
Output
6
Input
2
aa
Output
2

题意：
给出一个长为n的字符串s，求相交的回文子串（包括包含）的个数对51123987取模。

解法：
考虑用总数减去所有不相交的回文子串个数。首先利用manacher算法求出以每个字符为中心的的回文串长度，然后用l[i]表示以i为起点的回文子串数量，r[i]表示以i为终点的回文子串数量，于是对于每个字符，减去l[i]*r[j<i]（以它前面的字符为终点的回文子串和以它为起点的回文子串均不相交）即可。
一开始TLE了，检查了好久都没发现哪里有问题，最后稍微改了一下manacher的写法就AC了，实在是很奇怪。
做法来自于https://blog.csdn.net/wmhtxdy/article/details/103983165。

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<stdlib.h>
#include<cstring>
using namespace std;

int n;
int len=1;
long long ans=0,pre=0,mod=51123987;
int p[4000000+5],l[4000000+5],r[4000000+5];
char s[4000000+5];

void manacher(){
    int id=0,mx=0;
    for(int i=1;i<=len;i++){
        if(i<id+mx)p[i]=min(p[2*id-i],id+mx-i);
        else p[i]=1;
        while(s[i-p[i]]==s[i+p[i]])p[i]++;
        if(id+mx<i+p[i]){
            id=i;
            mx=p[i];
        }
    }
}

int main()
{
    scanf("%d%c",&n,&s[0]);
    s[0]='$';s[1]='#';
    for(int i=1;i<=n;i++){
        scanf("%c",&s[++len]);
        s[++len]='#';
    }
    manacher();
    for(int i=1;i<=len;i++){
        l[i-p[i]+1]++;l[i+1]--;r[i]++;r[i+p[i]]--;
        ans=(ans+(long long)p[i]/2)%mod;
    }
    ans=ans*(ans-1)/2%mod;
    for(int i=1;i<=len;i++){
        l[i]+=l[i-1];r[i]+=r[i-1];
        if(i%2==0){
            ans=(ans-pre*(long long)l[i]%mod)%mod;
            pre=(pre+(long long)r[i])%mod;
        }
    }
    printf("%lld\n",(ans+mod)%mod);
    return 0;
}