CMI2014-B-05

Question

At the end of its fifth successful season, the Siruseri Premier League is planning to give an award to the Most Improved Batsman over the five years. For this, an Improvement Index will be computed for each batsman. This is defined as the longest sequence of increasing scores by the batsman among all his scores over the five seasons. For example, if the scores for a batsman over the five seasons are $(20, 23, 6, 34, 22, 52, 42, 67, 89, 5, 100)$, his Improvement Index is $7$ based on the sequence $(20, 23, 34, 52, 67, 89, 100)$. Describe an efficient algorithm based on dynamic programming to compute the Improvement Index for a batsman with an overall sequence of $n$ scores. Analyze the complexity of your algorithm.

Answer 1