Hi!
I was trying to solve SUPPER problem with python but I'm getting time limit exceded.
My algorithm to calculate the LIS is o(n^2) and to get all the numbers present in some LIS is O(n).
Is that too bad for this problem or just python is that slow?
--
JP