CF620F.Xors on Segments
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are given an array with n integers ai and m queries. Each query is described by two integers (lj,rj) .
Let's define the function . The function is defined for only u<=v .
For each query print the maximal value of the function f(ax,ay) over all lj<=x,y<=rj, ax<=ay .
输入格式
The first line contains two integers n,m ( 1<=n<=5⋅104, 1<=m<=5⋅103 ) — the size of the array and the number of the queries.
The second line contains n integers ai ( 1<=ai<=106 ) — the elements of the array a .
Each of the next m lines contains two integers lj,rj ( 1<=lj<=rj<=n ) – the parameters of the j -th query.
输出格式
For each query print the value aj on a separate line — the maximal value of the function f(ax,ay) over all lj<=x,y<=rj, ax<=ay .
输入输出样例
输入#1
6 3 1 2 3 4 5 6 1 6 2 5 3 4
输出#1
7 7 7
输入#2
1 1 1 1 1
输出#2
1
输入#3
6 20 10 21312 2314 214 1 322 1 1 1 2 1 3 1 4 1 5 1 6 2 2 2 3 2 4 2 5 2 6 3 4 3 5 3 6 4 4 4 5 4 6 5 5 5 6 6 6
输出#3
10 21313 21313 21313 21313 21313 21312 21313 21313 21313 21313 2314 2315 2315 214 215 323 1 323 322