DP

1. Longest increasing sequence (LIS)
1. There is always a DAG of computation underlying every dynamic program but it is not always clear
2. http://bix.ucsd.edu/bioalgorithms/book/excerpt-ch6.pdf
3. http://wordaligned.org/articles/patience-sort.html (not sure correctness)
2. Given n houses and m colors. The cost of painting different house with different color might be different. Find out the min cost of painting all houses such that no adjacent houses have same color.