Problem 3

Dinesh and Cheenu are playing a game. Given an array A consisting of M positive integers, list all continuous non-empty subarrays of array A and replace all the subarrays with the maximum element present in the respective subarray. They both make moves turn by turn. In one turn, the player picks some number from the list and discards that number. The one who is not able to make a valid move will