***D. Maximum Xor Secondary( find max and 2nd max in all possible sub array of an array in o(n)) | implementation

***D. Maximum Xor Secondary( find max and 2nd max in all possible sub array of an array in o(n)) | implementation

Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1, x2, ..., xk (k > 1) is such maximum element xj, that the following inequality holds: .

The lucky number of the sequence of distinct positive integers x1, x2, ..., xk (k > 1) is the number that is equal to the bitwise excluding OR of the maximum element of the sequence and the second maximum element of the sequence.

You've got a sequence of distinct positive integers s1, s2, ..., sn (n > 1). Let's denote sequence sl, sl + 1, ..., sr as s[l..r] (1 ≤ l < r ≤ n). Your task is to find the maximum number among all lucky numbers of sequences s[l..r].

Note that as all numbers in sequence s are distinct, all the given definitions make sence.

Read full article from ***D. Maximum Xor Secondary( find max and 2nd max in all possible sub array of an array in o(n)) | implementation