题库练习 Bits And Pieces
← 上一题 下一题 →

A12798 | Bits And Pieces

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

You are given an array $a$ of $n$ integers.

You need to find the maximum value of $a_{i} | ( a_{j} \& a_{k} )$ over all triplets $(i,j,k)$ such that $i < j < k$ .

Here $\&$ denotes the [bitwise AND operation](https://en.wikipedia.org/wiki/Bitwise_operation#AND), and $|$ denotes the [bitwise OR operation](https://en.wikipedia.org/wiki/Bitwise_operation#OR).

输入格式

The first line of input contains the integer $n$ ( $3 \le n \le 10^{6}$ ), the size of the array $a$ .

Next line contains $n$ space separated integers $a_1$ , $a_2$ , ..., $a_n$ ( $0 \le a_{i} \le 2 \cdot 10^{6}$ ), representing the elements of the array $a$ .

输出格式

Output a single integer, the maximum value of the expression given in the statement.

输入输出样例

输入 #1
3
2 4 6
输出 #1
6
输入 #2
4
2 8 4 7
输出 #2
12
C++ 编辑器
输入
输出