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 was trying to solve problem 455C in Python. Here is my solution for the same in python (code). But this is giving me TLE in Test Case 5, though I got AC in Java code. Can someone help me?

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.