Common Subsequence-最长公共子序列

/*
Author: 2486
Memory: 4108 KB		Time: 32 MS
Language: C++		Result: Accepted
*/
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn=1000+5;
char str1[maxn],str2[maxn];
int dp[maxn][maxn];
int main() {
    while(~scanf("%s%s",str1+1,str2+1)) {
        int la=strlen(str1+1);
        int lb=strlen(str2+1);
        memset(dp,0,sizeof(dp));
        for(int i=1; i<=la; i++) {
            for(int j=1; j<=lb; j++) {
                if(str1[i]==str2[j]) {
                    dp[i][j]=dp[i-1][j-1]+1;
                } else if(str1[i]!=str2[j]) {
                    dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }
        printf("%d\n",dp[la][lb]);
    }

    return 0;
}

/*
Author: 2486
Memory: 728 KB		Time: 16 MS
Language: G++		Result: Accepted
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn=10000+5;
int dp[maxn];
string ss,kk;
int main() {
    while(cin>>ss>>kk) {
        memset(dp,0,sizeof(dp));
        int l,maxp;
        if(ss.length()<kk.length())swap(ss,kk);
        for(int i=0; i<ss.length(); i++) {
            maxp=0;
            for(int j=0; j<kk.length(); j++) {
                l=dp[j];
                if(ss[i]==kk[j]&&dp[j]<maxp+1)dp[j]=maxp+1;
                maxp=max(maxp,l);
            }
        }
        int ans=0;
        for(int i=0;i<ss.length();i++){
            ans=max(ans,dp[i]);
        }
        printf("%d\n",ans);
    }
    return 0;
}