Someone please help me with this problem. Please provide a detailed explanation.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Someone please help me with this problem. Please provide a detailed explanation.
I was trying to solve this dp problem on spoj LIS2(http://www.spoj.com/problems/LIS2/). I am basically using finding longest increasing subsequence using binary search. This is discussed here(geeksforgeeks)(https://www.geeksforgeeks.org/longest-monotonically-increasing-subsequence-size-n-log-n/). In lower bound method in my code I am deciding based which point is lowest based on the distance of the point with origin. But it is giving me wrong answer ================================. Can someone help me. Thanks in advance.
I recently started doing code in python. I wanted to know if I can folllow some people who code in python so that I will be able to refer to code after the codeforces contest. Thanks in advance.
Name |
---|