最长公共子序列

#include <iostream>
#include <cstring>
using namespace std;

int dp[1000][1000];
string st1, st2;
int main()
{
    while(cin >> st1 >> st2)
    {
       int len1 = st1.size();
       int len2 = st2.size();
       memset(dp, 0, sizeof(dp));
       for(int i = 1; i <= len1; i++)
       {
           for(int j = 1; j <= len2; ++j)
           {
               if(st1[i - 1] == st2[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];
           }
       }
       cout << dp[len1][len2] << endl;
    }
    return 0;
}