| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3648 |
| 2 | Benq | 3580 |
| 3 | orzdevinwang | 3570 |
| 4 | cnnfls_csy | 3569 |
| 5 | Geothermal | 3568 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3530 |
| 8 | Radewoosh | 3520 |
| 9 | Um_nik | 3481 |
| 10 | jiangly | 3467 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | adamant | 164 |
| 2 | awoo | 164 |
| 4 | TheScrasse | 160 |
| 5 | nor | 159 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 150 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
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.
