You can see the test case if it's small. Just output the input of that testcase.

Thanks

Here's how you can normally resolve situations like this during the contest.

• Write a very naive and simple solution to the problem (maybe exponential complexity). One that tries to use no "special" logic, just the barest possible brute force. In this problem, it would be recursively trying to apply the operation on every position.
• Write a program to generate thousands of small test cases.
• Using those two, find a test case where your program gives the wrong answer.

By the way, I would be careful about calling counterexamples to your solution "edge cases". I mean, sometimes it's true and your solution is just wrong on some very specific cases like $$$n = 1$$$ or whatever. But it might be that your solution is just wrong.

For example in this problem, all your program does is finds the pair of adjacent elements with the largest difference and applies the operation to that. But for example, this means you do

while it would be better to do

I don't think it's fair to call this an edge case. Rather, it's an example demonstrating something that your program doesn't take into account: it might sometimes be better to make a not-so-good operation because it opens up very good operations for later.

Your code might be failing on this test case.

3 2

3 2 1

your code will output 4(I wrote a similar solution and got the same verdict) correct output is 3