11046번: 팰린드롬?? ↗

#include <bits/stdc++.h>

#define for1(s,n) for(int i = s; i < n; i++)
#define for1j(s,n) for(int j = s; j < n; j++)
#define foreach(k) for(auto i : k)
#define foreachj(k) for(auto j : k)
#define pb(a) push_back(a)
#define sz(a) a.size()
#define MX 2200000

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef vector <int> iv1;
typedef vector <vector<int>> iv2;
typedef vector <ll> llv1;
typedef unsigned int uint;
typedef vector <ull> ullv1;
typedef vector <vector <ull>> ullv2;

ll D[MX];

void manacher(llv1 s) {
    ll r = 0;
    ll p = 0;
    for1(0, s.size()) {
        if(i <= r) {
            D[i] = min(D[2 * p - i], r - i);
        }
        else D[i] = 0;

        while(i - D[i] - 1 >= 0 && i + D[i] + 1 < s.size() && s[i - D[i] - 1] == s[i + D[i] + 1]) {
            D[i]++;
        }
        if(r < i + D[i]) {
            r = i + D[i];
            p = i;
        }
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    llv1 V;
    ll N;
    cin >> N;
    V.pb(-1);
    for1(0, N) {
        ll a;
        cin >> a;
        V.pb(a);
        V.pb(-1);
    }
    
    manacher(V);

    ll M;
    cin >> M;
    for1(0, M) {
        ll a, b, c;
        cin >> a >> b;
        c = b-a+1;
        a = 2*a-1;
        b = 2*b-1;
        if(D[(a+b)/2] >= c) {
            cout << "1\n";
        }
        else {
            cout << "0\n";
        }
    }
    
}