Common Subsequence

http://acm.hdu.edu.cn/showproblem.php?pid=1159

最长公共子序列

#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
const int N=1010;
char s1[N],s2[N];
int dp[N][N];

int main()
{
    while(~scanf("%s%s",s1,s2))
    {
        int len1 = strlen(s1);
        int len2 = strlen(s2);
        for (int i = 0; i <= len1; i++)
            dp[i][0] = 0;
        for (int j = 0; j <= len2; j++)
            dp[0][j] = 0;
        for (int i = 1; i <= len1; i++)
        {
            for (int j = 1; j <= len2; j++)
            {
                if (s1[i-1]==s2[j-1])
                    dp[i][j] = dp[i-1][j-1]+1;
                else
                    dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
            }
        }
        printf("%d
",dp[len1][len2]);
    }
    return 0;
}

有关最长公共子序列的知识点：

http://blog.csdn.net/yysdsyl/article/details/4226630

http://blog.csdn.net/rrrfff/article/details/7523437

http://www.cnblogs.com/zhangchaoyang/articles/2012070.html