@How to approaching this question

#1

how can i approach the question, I am unable to start implementing this problem . i am unable to think about fine and implementable logic.

#2

You can make 2 array, one inc, that will have at ith position length of the increasing sequence till i, similary a dec array that will have length of decreasing sequence till ith (ith till n).
For inc array compute the sequence length from left to right
For dec array compute the sequence length from right to left.
Now for every i you have both increasing length till that point and decreasing length to get answer.
Eg
1 6 8 9 3 4 6 5
inc array
1 2 3 4 1 2 3 1
dec array
1 1 1 2 1 1 1 2
Ans 4 + 2 -1

#3

i have implemented the solution but have issue of time limit in test case 1. can you tell me what is wrong with my code.

#4

please provide me your code.

#5

Thank you for your support , i got the concept of fast I/O.

#6

If your doubt is resolved please mark it as resolved.