Shil and Special Xor Sum

CodeChefOpen on judge ↗

Shil has an array of N integers A1, A2.....AN. He challenges to find the Special Xor Sum for this array. - Special XorSum can be defined as Σ(Rmq(i,j)^Ai^Aj) where 1 ≤ i j ≤ N . - Rmq(i,j) is defined as max(Ai, Ai+1 .... Aj) . - Here ^ denotes Bitwise Xor operation. Input First line of input consists of integer N. Next line contains N integers A1, A2...AN Output Print the Special Xor Sum

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI