After contest i found my submission for the Problem — 1393B - Applejack and Storages incorrect but in system testing my solution passed all the test cases.

Here's my submission — 89257174

Solution fails on the following test case :

12
1 1 1 1 2 2 2 2 3 3 3 3
1
+ 10

Correct Answer is YES but my code is printing NO. I request AlFlen, ksun48, 300iq, isaf27 to look into this issue.

I need help in finding Longest Increasing Sub-sequence in minimum Time complexity.