Notice that a[i] is bounded by at most 50. So for each distinct numerical value, you can iterate backwards in your array and update your answer for a number every time you hit a number greater than the one you're testing. So for the break case let's say we're processing 1:

We see 5 and note that it's greater than 1 so we store it as our answer. Then we see 2 and note that it's also greater than 1 so we store that as our answer. Then we get to a position that actually has a 1 so we set the answer for that index to be 2.

And since there are at most 50 distinct numbers, you're only doing 50 * 10^5 iterations which is definitely doable in a second.

You can use a stack. Push the indices into the stack from left to right until its corresponding values are non-increasing. If you find an index whose value is higher than the topmost index's value, recursively pop until non-increasing condition is maintained in the stack and insert the new index. For all the indices popped by an index i, A[i] is the corresponding value in their Ans array. -1 for others