Describe your issue
For the test case,
T = 1
N = 4
A = [1,-1,-1,1]
The “maximum subarray” is “[1] at index 0” (or) “[1] at index 3” and also the “minimum number of operations” needed to maximize the value of the maximum subarray is “0”.
But the test case in the CodeChef platform considers the “maximum subarray” as “[1,-1,-1,1] starting from index 0 to index 3”, and the “minimum number of operations” needed to maximize the value of the maximum subarray sum as “2”.
Screenshot
Wrong test case :
