Someone please help me with this problem. Please provide a detailed explanation.
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | Petr | 145 |
9 | pajenegod | 145 |
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 |
---|