HDU Common Subsequence 最长公共子序列

DP入门题

转移方程：

if (i == 0 || j == 0) dp[i,j] = 0

else if (X[i] == Y[j]) dp[i,j] = dp[i-1,j-1] + 1

else dp[i,j] = max(dp[i-1,j], dp[i,j-1])

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int const MAXN = 500;
int dp[MAXN][MAXN] = {0};
char str1[MAXN];
char str2[MAXN];

int main()
{
    while (scanf("%s%s",str1,str2) != EOF)
    {
        int len1 = strlen(str1);
        int len2 = strlen(str2);
        for (int i = 1; i <= len1; i++)
        {
            for (int j = 1; j <= len2; j++)
            {
                if (str1[i-1] == str2[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\n",dp[len1][len2]);
    }

    return 0;
}