最长公共子序列

A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, ..., xm> another sequence Z = <z1, z2, ..., zk> is a subsequence of X if there exists a strictly increasing sequence <i1, i2, ..., ik> of indices of X such that for all j = 1,2,...,k, xij = zj. For example, Z = <a, b, f, c> is a subsequence of X = <a, b, c, f, b, c> with index sequence <1, 2, 4, 6>. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y. 
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line. 

Input

abcfbc abfcab
programming contest 
abcd mnp

Output

4
2
0
最长公共子序列，这个是动态规划的算法中的基础。学习动态规划的入门。
首先普及一个知识就是这个最长公共子串和最长公共子序列的区别。
最长公共子串是一段连续字符串，最长公共子序列是一段字符串相同的元素
  

思路：
用动态规划进行解题：
借用一下别人的图形
                                                                         
看上面的图形就可以发现它是如何找到相同的元素的。
过程很详细。
在这道题中同理也可以按照这种思路，就可以把这道题解出来。
分别记下字符串的长度然后再进行遍布寻找有几个相同元素
char a[2048],b[2048];     //数组要开大一点不然会超时
int dp[2055][2055];
int xdzm(int n,int m)
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(a[i-1]==b[j-1])
            {
 
                dp[i][j]=dp[i-1][j-1]+1;
            }
            else
            {
                if(dp[i-1][j]>=dp[i][j-1])
                    dp[i][j]=dp[i-1][j];
                else
                    dp[i][j]=dp[i][j-1];
            }
        }
    }
    return dp[n][m];
}
int main()
{
    while(~scanf("%s%s",a,b))
    {
        int l1,l2;
         l1=strlen(a);
         l2=strlen(b);
        memset(dp,0,sizeof(dp));
        int ans=xdzm(l1,l2);
        printf("%d\n",ans);
    }
}