Question: We consider some sequence (b1, b2, ..., bm) to be interesting if |bi+1 ? bi | < K for all 1 ? i ? m

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 given positive number. You are given a sequence of n numbers: (a1, a2, ..., an) and a number K. Give an algorithm which finds the length of the longest interesting subsequence of the given sequence. The time complexity of your algorithm should be O(n^2 )

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!