| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
The problem link is http://www.spoj.com/problems/LIS2/
I used the nlogn algorithm for longest increasing subsequence. This is my code http://ideone.com/rmaQSE#
I am getting the correct answer for the sample test case given in the problem in g++11 compiler. But i am getting wrong answer #1 for my submission in spoj. could someone go through my code and tell me where i am going wrong!
Check Brian Bi's answer to this: http://stackoverflow.com/questions/8716934/longest-increasing-subsequence-lis-with-two-numbers/8719900#8719900
I recommend you try think and find out what he means with a "staircase-like data structure"("coastline"). However I could try to explain it.