/**
 * This class implements a solution for the classic problem longest decreasing
 * subsequence. You must use dynamic programming to solve this problem. It is
 * possible to implement this using just a one-dimensional array..
 */

public class LDS {
	/**
	 * This function returns the length of the longest decreasing subsequence of
	 * the int array. If the int array has length 0, the return should be 0.
	 *
	 * @param a
	 *	A list of integers from which to find the LDS
	 */
	public static int lds (int [] a)
	{
		return -1;
	}
}