We consider some sequence (b1, b2, …, bm) to be interesting if|bi+1 ? bi | < K for all 1 ? i ? m ? 1, where K is a givenpositive number. You are given a sequence of n numbers: (a1, a2,…, an) and a number K. Give an algorithm which finds the lengthof the longest interesting subsequence of the given sequence. Thetime complexity of your algorithm should be O(n^2 )
Expert Answer
An answer will be send to you shortly. . . . .