Codeforces Round #483 (Div. 2) D. XOR-pyramid 连续子区间异或最大和

D. XOR-pyramid

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

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

$f\left(b\right)=\{\begin{array}{cc}b\left[1\right]& \text{if}m=1\\ f\left(b\right[1]\oplus b[2],b[2]\oplus b[3],\dots ,b[m-1]\oplus b[m\left]\right)& \text{otherwise,}\end{array}$

where $\oplus$ is bitwise exclusive OR.

For example, $f(1,2,4,8)=f(1\oplus 2,2\oplus 4,4\oplus 8)=f(3,6,12)=f(3\oplus 6,6\oplus 12)=f(5,10)=f(5\oplus 10)=f\left(15\right)=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},\dots ,a_r$.

Input

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

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

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

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

Output

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

Examples

input

Copy

3
8 4 1
2
2 3
1 2

output

Copy

5
12

input

Copy

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

output

Copy

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]$.

BUG反馈门

/**
题意:求解区间连续子序列的异或和最大值

dp[l][r]:区间异或和结果
预处理:输入为dp[l][l];
dp[l][r]=dp[l][r-1]^dp[l+1][r];
因此可以引用区间dp的思想,以长度进行枚举
不断更新ans[l][r](区间异或最大值);
那么我们只需要找到影响ans[l][r]的因素
类似的 dp[l+1][r]^dp[l][r-]得到区间异或和dp[l][r]
那么我们可以得到影响ans[l][r]的因素存在三个
ans[l][r-1],ans[l+1][r],dp[l][r];
其实上述过程还可以通过杨辉三角找规律进行实现;

由于题目给的空间是512mb 因此在这里二维(5e3)是不会MLE的;
总的来说  暴力预处理o(n^2) o(1)查询

*/

#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int maxn=5e3+7;
int dp[maxn][maxn],ans[maxn][maxn];

int main (){
	ios_base::sync_with_stdio(false);
	ll n,q,l,r;cin>>n;
	for(int i=1;i<=n;i++) cin>>dp[i][i],ans[i][i]=dp[i][i];
	for(int len=2;len<=n;len++){
		for(l=1,r;(r=l+len-1)<=n;l++){
			dp[l][r]=dp[l][r-1]^dp[l+1][r];
			ans[l][r]=max(dp[l][r],max(ans[l][r-1],ans[l+1][r]));
		}
	}
	cin>>q;
	while(q--){
		cin>>l>>r;
		cout<<ans[l][r]<<endl;
	}
	return 0;
}