Maximum bitonic subarray

my code is compiling successfully and showing right output but one test case is failing because of timelimit. I have my program runs in O(n) time what can be better than this for this program

What is wrong ?


https://codeshare.io/5o84Pb

Hi @vikanshu2016 if both t and n are really large for all the test cases, the constraints are quite large and you may need to optimise it further.

but O(n) is the minimum time, how can I optimise it further.

@vikanshu2016 I will get back to you shortly

how much more time ?

@vikanshu2016 please drop an email at [email protected] along with the problem link
This issue has been noted.