| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
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.
