AND of Maximums

CodeChefOpen on judge ↗

You are given an array of $N$ integers $[A_1, A_2, \ldots, A_N]$ and an integer $K \le N$. You are going to split the array into $K$ consecutive nonempty subarrays, so that every element is included in exactly one subarray, then to find the maximum value in each subarray, and to calculate the bitwise ``AND`` of all these maximums. What is the largest possible integer you can obtain as a result? #

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