I was solving ISBIAS from January Long Challenge, I came up with a dynamic programming approach where I simply calculated the count of increasing and decreasing subsequences for each index and stored the (count of increasing - count of decreasing) in an array for each index.

I first calculated all values of this array for given length N .

Did it in O(n) timecomplexity.

Then for each query, i had answer ready which could be fetched in O(1) complexity.

So total complexity was O(n+q) .

I implemented this in c++ 14

Here’s my code https://www.codechef.com/viewsolution/28744208

It was showing me TLE , then I wrote the exact same logic in Python3.6 , and got it accepted with just 0.65s time.

My Python3.6 Code-

https://www.codechef.com/viewsolution/28767171

So what is stopping my c++ code from being accepted? Why is it showing TLE for exact same logic?

Need help !