[Manacher][线段树] Codeforces 100032 K - Subpalindromes

$Solution$

%%%%%%%%%%%%%%%%%%%%%%%%LargestJN

大佬教我做题。
大佬说有点麻烦的大概就是这个东西$\text{min}\{i-L,R-i,len\}$。
大佬说如果在询问的中点处将询问分开，回文中心在一边的就可以去掉一个$\text{min}$里的东西，离线以后，相当于线段树区间加，区间求和。
大佬说偶数情况要细心讨论。
大佬太强了。
我太菜了manacher都打错。
我太菜了我太菜了我太菜了。

#include <bits/stdc++.h>
#define show(x) cerr << #x << " = " << x << endl
using namespace std;

typedef long long ll;
typedef pair<int, int> pairs;
const int N = 606060;

inline char get(void) {
    static char buf[100000], *S = buf, *T = buf;
    if (S == T) {
        T = (S = buf) + fread(buf, 1, 100000, stdin);
        if (S == T) return EOF;
    }
    return *S++;
}
template<typename T>
inline void read(T &x) {
    static char c; x = 0; int sgn = 0;
    for (c = get(); c < '0' || c > '9'; c = get()) if (c == '-') sgn = 1;
    for (; c >= '0' && c <= '9'; c = get()) x = x * 10 + c - '0';
    if (sgn) x = -x;
}
inline void read(char *c) {
    for (*c = get(); *c < 'a' || *c > 'z'; *c = get());
    for (; *c >= 'a' && *c <= 'z'; *c = get()) ++c;
    *c = 0;
}

namespace segTree {
    int ad[N << 2];
    ll sm[N << 2];
    inline void mark(int o, int x, int l, int r) {
        ad[o] += x; sm[o] += (ll)x * (r - l + 1);
    }
    inline void pushDown(int o, int l, int r) {
        if (ad[o]) {
            int mid = (l + r) >> 1;
            mark(o << 1, ad[o], l, mid);
            mark(o << 1 | 1, ad[o], mid + 1, r);
            ad[o] = 0;
        }
    }
    inline void pushUp(int o) {
        sm[o] = sm[o << 1] + sm[o << 1 | 1];
    }
    inline void add(int o, int l, int r, int L, int R, int x) {
        if (L > R) return;
        if (l >= L && r <= R) return mark(o, x, l, r);
        int mid = (l + r) >> 1; pushDown(o, l, r);
        if (L <= mid) add(o << 1, l, mid, L, R, x);
        if (R > mid) add(o << 1 | 1, mid + 1, r, L, R, x);
        pushUp(o);
    }
    inline ll sum(int o, int l, int r, int L, int R) {
        if (L > R) return 0;
        if (l >= L && r <= R) return sm[o];
        int mid = (l + r) >> 1; pushDown(o, l, r);
        ll res = 0;
        if (L <= mid) res += sum(o << 1, l, mid, L, R);
        if (R > mid) res += sum(o << 1 | 1, mid + 1, r, L, R);
        return res;
    }
    inline void clear(void) {
        memset(ad, 0, sizeof ad);
        memset(sm, 0, sizeof sm);
    }
}

int p[N];
ll ans[N];
int id, mx, n, m;
char s[N];
struct qry {
    int l, r, id;
} cur;
vector<qry> v[N];

inline void manacher(char *begin, char *end) {
    static char str[N], num[N];
    int len = 0;
    str[len++] = '$'; str[len++] = '#';
    for (char *c = begin; c != end; c++) {
        str[len++] = *c;
        str[len++] = '#';
    }
    str[len] = 0;
    id = mx = 0;
    for (int i = 0; i < len; i++) {
        if (mx > i) p[i] = min(mx - i, p[id * 2 - i]);
        else p[i] = 1;
        while (str[i - p[i]] == str[i + p[i]]) ++p[i];
        if (i + p[i] > mx) {
            mx = i + p[i];
            id = i;
        }
    }
    for (int i = 0; i < len; i++) --p[i];
}

using segTree::add;
using segTree::sum;

int main(void) {
    freopen("1.in", "r", stdin);
    freopen("1.out", "w", stdout);
    read(s + 1); n = strlen(s + 1);
    manacher(s + 1, s + 1 + n);
    read(m);
    for (int i = 1; i <= m; i++) {
        read(cur.l); read(cur.r);
        cur.id = i;
        v[cur.l + cur.r >> 1].push_back(cur);
    }
    for (int i = 1; i <= n; i++) {
        int x = p[i << 1] >> 1;
        add(1, 1, n, i - x, i, 1);
        for (auto u: v[i])
            ans[u.id] += sum(1, 1, n, u.l, i);
        x = p[i << 1 | 1] >> 1; --x;
        add(1, 1, n, i - x, i, 1);
    }
    segTree::clear();
    for (int i = n; i >= 1; i--) {
        int x = p[i << 1] >> 1;
        add(1, 1, n, i, i + x, 1);
        x = p[i * 2 - 1] >> 1;
        add(1, 1, n, i, i + x - 1, 1);
        if (i > 1)
            for (auto u: v[i - 1])
                ans[u.id] += sum(1, 1, n, i, u.r);
    }
    for (int i = 1; i <= m; i++)
        printf("%lld\n", ans[i]);
    return 0;
}