Codeforences 17E Palisection

【题意】给定一个长度为n的小写字母串。问你有多少对相交的回文子串（包含也算相交）。n ≤ 2 ∗ 10 6

【解题方法】可知求相交的比较难，但是求不相交的却很简单，先用manacher算法o(n)的求出每个点的回文串最长有多长。再求出st,en数组，分别代表以i为开头的回文串有几个，以i为结尾的回文串有几个。这可以利用标记再加上前缀和求，最后要求的不相交个数是：sum( start[j] * sum(end[i]| 1<= i <= j) |  1<=j<= n)。但是我并没有AC这道题目， 或者说只有一组数据没有AC,就是1000000个1的数据，实在不知道哪里会错，debug了3+小时都没有发现。。。AC代码可以看这篇博客：点击打开链接

【我的只有一组数据没AC的代码】跪求告诉本弱，到底是哪里写跪了QAQ

//
//Created by just_sort 2016/12/14
//Copyright (c) 2016 just_sort.All Rights Reserved
//

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/hash_policy.hpp>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
using namespace std;
using namespace __gnu_pbds;
typedef long long LL;
typedef pair<int, LL> pp;
#define MP(x,y) make_pair(x,y)
#define PI acos(-1)
const int maxn = 2100000+20;
const int maxm = 1<<12;
const int inf = 0x3f3f3f3f;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>order_set;
//head

const LL mod = 51123987;
char s[maxn], str[3*maxn];
int len1, len2;
LL p[maxn*3], ans, st[maxn], en[maxn];
LL vis1[maxn], vis2[maxn];
void init()
{
    str[0] = '$';
    str[1] = '#';
    for(int i = 0; i < len1; i++)
    {
        str[i*2+2] = s[i];
        str[i*2+3] = '#';
    }
    len2 = len1*2+2;
}
void manacher()
{
    int id = 0, mx = 0;
    for(int i = 1; i < len2; i++)
    {
        if(mx > i) p[i] = min(p[2*id-i], 1LL*(mx-i));
        else p[i] = 1LL;
        for( ; str[i+p[i]] == str[i-p[i]]; p[i]++);
        if(p[i] + i > mx)
        {
            mx = p[i] + i;
            id = i;
        }
    }
}

void add(LL &x, LL y)
{
    x += y;
    if(x > mod) x -= mod;
}

LL powmod(LL a, LL n)
{
    LL res = 1;
    while(n)
    {
        if(n&1) res = res*a%mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}
int main()
{
#ifdef in
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    //cout<<"233"<<endl;
#endif
    int n;
    while(cin>>n>>s)
    {
        len1 = strlen(s);
        memset(st, 0, sizeof(st));
        memset(en, 0, sizeof(en));
        init();
        manacher();
        //zongshu
        LL zs  = 0;
        for(int i = 1; i < len2; i++)
        {
            if(i&1) zs += (p[i] - 1LL) / 2LL;
            else zs += (p[i] - 1LL) / 2LL + 1LL;
        }
        //cout<<zs<<endl;
        //zs = ((zs%mod)*((zs-1)%mod)%mod) / 2;
        if(zs % 2LL == 0)
        {
            zs = ((zs / 2LL) % mod) * ((zs - 1LL) % mod) % mod;
            zs %= mod;
        }
        else
        {
            zs = (((zs - 1LL )/ 2LL % mod) * (zs) % mod) % mod;
            zs %= mod;
        }
        //buxiangjiaoduishu
        for(int i = 1; i < len2; i++)
        {
            if(i&1) //'#'
            {
                if(p[i] == 1) continue;
                //biaojikaitou
                add(vis1[(i-p[i]+2)/2], 1);
                add(vis1[(i+1)/2], -1);
                //biaojijiewei
                add(vis2[(i+p[i]-2)/2], 1);
                add(vis2[(i-1)/2], -1);
            }
            else //zifu
            {
                //biaojikaotou
                add(vis1[(i-p[i]+2)/2], 1);
                add(vis1[(i+2)/2], -1);
                //biaojijiewei
                add(vis2[(i+p[i]-2)/2], 1);
                add(vis2[(i-2)/2], -1);
            }
        }
        for(int i = 1; i <= len1; i++)
        {
            add(vis1[i], vis1[i-1]);
            st[i] = vis1[i];
        }
        vis2[len1 + 1] = 0;
        for(int i = len1; i >= 1; i--)
        {
            add(vis2[i], vis2[i+1]);
            en[i] = vis2[i];
        }
        ans = 0;

        for(int i = 2; i <= len1; i++)
        {
            add(en[i], en[i-1]);
            add(ans, en[i-1]*st[i]%mod);
        }
        //cout<<ans<<endl;
        cout<<(zs-ans+mod)%mod<<endl;
    }
    return 0;
}