CF252A.Little Xor

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Little Petya likes arrays that consist of non-negative integers a lot. Recently his mom has presented him one such array consisting of $n$ elements. Petya immediately decided to find there a segment of consecutive elements, such that the $xor$ of all numbers from this segment was maximal possible. Help him with that.

The $xor$ operation is the bitwise exclusive "OR", that is denoted as "xor" in Pascal and "^" in C/C++/Java.

输入格式

The first line contains integer $n$ ( $1<=n<=100$ ) — the number of elements in the array. The second line contains the space-separated integers from the array. All numbers are non-negative integers strictly less than $2^{30}$ .

输出格式

Print a single integer — the required maximal $xor$ of a segment of consecutive elements.

输入输出样例

输入#1
```
5
1 2 1 1 2
```
输出#1
```
3
```
输入#2
```
3
1 2 7
```
输出#2
```
7
```
输入#3
```
4
4 2 4 8
```
输出#3
```
14
```

说明/提示

In the first sample one of the optimal segments is the segment that consists of the first and the second array elements, if we consider the array elements indexed starting from one.

The second sample contains only one optimal segment, which contains exactly one array element (element with index three).

首页