Given an array a of integers, find the maximum of j - i subjected to the constraint of a[i] <= a[j]. If there is no solution possible, return -1.
Answers
Answered by
0
Step-by-step explanation:
........
I don't no answer....
Similar questions