While solving a problem, I am getting an error of SIGTSTP (also showing time limit exceeded).It’s perfectly working with the given sample case as well as my custom set of inputs. Link to my code : https://www.codechef.com/viewsolution/22787620
It’s TLE ?
Not SIGTSTP.
Question is about finding longest increasing subsequence and your solution is too slow to pass in given constraints ( O(n^2)).
Try to search an optimal solution on google.
HERE is the link for an optimal solution