CF984D XOR-pyramid

原题链接：http://codeforces.com/contest/984/problem/D

XOR-pyramid

For an array $b$ of length $m$ we define the function $f$ as

$$f(b)=\left\{ \begin{array}\\ b[1]&&if\ m=1\\ f(b[1]⊕b[2],b[2]⊕b[3],\cdots,b[m-1]⊕b[m])&&otherwise, \end{array}\right.$$

where $⊕$ is bitwise exclusive OR.

For example, $f(1,2,4,8)=f(1⊕2,2⊕4,4⊕8)=f(3,6,12)=f(3⊕6,6⊕12)=f(5,10)=f(5⊕10)=f(15)=15$
You are given an array $a$ and a few queries. Each query is represented as two integers $l$ and $r$. The answer is the maximum value of $f$ on all continuous subsegments of the array $a_l,a_{l+1},\cdots,a_r$.

Input

The first line contains a single integer $n (1≤n≤5000)$ — the length of $a$.

The second line contains $n$ integers $a_1,a_2,\cdots,a_n (0≤a_i≤2^{30}−1)$ — the elements of the array.

The third line contains a single integer $q (1≤q≤100000)$ — the number of queries.

Each of the next $q$ lines contains a query represented as two integers $l, r (1≤l≤r≤n)$.

Output

Print $q$ lines — the answers for the queries.

Examples

input

3
8 4 1
2
2 3
1 2

output

5
12

input

6
1 2 4 8 16 32
4
1 6
2 5
3 4
1 2

output

60
30
12
3

Note

In first sample in both queries the maximum value of the function is reached on the subsegment that is equal to the whole segment.

In second sample, optimal segment for first query are $[3,6]$, for second query — $[2,5]$, for third — $[3,4]$, for fourth — $[1,2]$.

题解

手动模拟一下，不难发现每个数出现的次数与杨辉三角形相同，设$sum[i][j]=f(b[i],b[i+1],\cdots,b[j])$，就有与杨辉三角形相同的性质，即$sum[i][j]=sum[i][j-1]⊕sum[i+1][j]$，这样就可以$O(n^2)$处理出所有区间的$sum$，再加一个简单的区间$dp$即可$AC$。

代码

#include<bits/stdc++.h>
using namespace std;
const int M=5005;
int sum[M][M],dp[M][M],n,m,a,b;
void in(){scanf("%d",&n);for(int i=1;i<=n;++i)scanf("%d",&sum[i][i]),dp[i][i]=sum[i][i];}
void ac()
{
    for(int len=2;len<=n;++len)for(int i=1,j;i<=n-len+1;++i)
    j=i+len-1,sum[i][j]=sum[i][j-1]^sum[i+1][j],dp[i][j]=max(max(dp[i][j-1],dp[i+1][j]),sum[i][j]);
    scanf("%d",&m);
    while(m--)scanf("%d%d",&a,&b),printf("%d\n",dp[a][b]);
}
int main(){in();ac();}