CF983B

传送门：CF983B

/*
区间dp，异或的性质

*/
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;
typedef long long LL;
const int MAXN=5e3+5;
int a[MAXN];
int dp[MAXN][MAXN];

int main(){
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        dp[i][i]=a[i];
    }
    for(int k=2;k<=n;k++){
        for(int i=1,j;(j=i+k-1)<=n;i++){
            dp[i][j]=dp[i][j-1]^dp[i+1][j];
        }
    }
    for(int k=2;k<=n;k++){
        for(int i=1,j;(j=i+k-1)<=n;i++){
            dp[i][j]=max(dp[i][j],max(dp[i][j-1],dp[i+1][j]));
        }
    }
    int m;
    scanf("%d",&m);
    int l,r;
    while(m--){
        scanf("%d%d",&l,&r);
        printf("%d\n",dp[l][r]);
    }
    return 0;
}