301346: CF252A. Little Xor
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Little Xor
题意翻译
### 题目大意: 给出一个正整数序列,求异或和最大的连续子段和。 ### 输入: 第一行一个数n,($1\leq n\leq 100$ );第二行n个整数,所有数最大不超过$2^{30}$ 。 ### 输出: 一个数,即最大的异或和。题目描述
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