Codeforces984D 、XOR-pyramid（DP）

D. XOR-pyramid

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

For an array bb of length mm we define the function ff as

f(b)={b[1]if m=1f(b[1]⊕b[2],b[2]⊕b[3],…,b[m−1]⊕b[m])otherwise,f(b)={b[1]if m=1f(b[1]⊕b[2],b[2]⊕b[3],…,b[m−1]⊕b[m])otherwise,

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)=15f(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 aa and a few queries. Each query is represented as two integers ll and rr. The answer is the maximum value of ff on all continuous subsegments of the array al,al+1,…,aral,al+1,…,ar.

Input

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

The second line contains nn integers a1,a2,…,ana1,a2,…,an (0≤ai≤230−10≤ai≤230−1) — the elements of the array.

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

Each of the next qq lines contains a query represented as two integers ll, rr (1≤l≤r≤n1≤l≤r≤n).

Output

Print qq 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][3,6], for second query — [2,5][2,5], for third — [3,4][3,4], for fourth — [1,2][1,2].

 

一、原题地址

    传送门

二、大致题意

    给出n个数，查询在（l,r）段上的最大的异或值。

三、思路

    将整张图更新完成，然后O（n）查询。

    状态的转移方程为m[i][j]=m[i][j-1]^m[i+1][j].

四、代码

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<stack>
using namespace std;
const int inf=0x3f3f3f3f;
long long  gcd(long long  a,long long  b){ return a == 0 ? b : gcd(b % a, a); } 


int n;
int m[5005][5005],ans[5005][5005];
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&m[i][i]);
		ans[i][i]=m[i][i];
	}
	for(int len=0;len<=n-2;len++)
	{
		for(int l=1;l+len+1<=n;l++)
		{
			int r=l+len+1;
			m[l][r]=m[l][r-1]^m[l+1][r];
			ans[l][r]=max(m[l][r],max(ans[l][r-1],ans[l+1][r]));
		}
	}
	int q;
	scanf("%d",&q);
	while(q--)
	{
		int l,r;
		scanf("%d%d",&l,&r);
		printf("%d\n",ans[l][r]);
	}
	getchar();
	getchar();
}