CS 4349: Algorithms
Spring 2008
Assignment 4

Due: Wednesday, February 20 (in class)


1. The longest monotonic subsequence problem is solved by the following DP:

LMS(A, n)  // find the LMS of a sequence A[1..n]
           // stores LMS that ends with A[i] in L[i]
{
  L[1] = 1;
  for(i=2; i<=n; i++) {
    L[i] = 1;
    for(k=1; k<i; k++) {
      if (A[k] < A[i]) {
        L[i] = max(L[i], L[k]+1);
      }
    }

  lms = 1;
  for(i=2; i<=n; i++) {
    lms = max(lms, L[i]);
  }
  return lms;
}


Add additional code so that it prints out an actual LMS before it returns.