Longest Substring using dp and thinking on dp

Problem:

find the longest consecutive substring of two string S, K. Use DP.

Solution:

    Matrix: m[m][n]

        m[i][j] = 0, if Si != Kj;

        m[i][j] = m[i-1][j-1] + 1 if Si == Kj;

    Iterate over the matrix to find the maximum. print those solutions.

    The matrix is also called longest suffix matrix.

Thinking:

1. In dp, some space is used to put the intermediate result, but the intermediate result at the desired place needn't be the final result. Everything is ok, iff you can get the answer correctly and efficiently.

2. Problems can be converted into each other, the essence of longest sub string is longest suffix.

From: http://blog.csdn.net/cheetach119/article/details/11270147