LCS(Longest Common Subsequence)最长公共子序列

#include <cstdio>
#include <algorithm>
using namespace std;
int main()
{
    int len[2];
    char str[2][1000];
    scanf("%d %d\n", &len[0], &len[1]);
    int DP[ len[0] + 1 ][ len[1] + 1 ];
    gets( str[0] + 1 );
    gets( str[1] + 1 );
    for( int i = 0; i <= len[0]; ++i )
        DP[i][0] = 0;
    for( int i = 0; i <= len[1]; ++i )
        DP[0][i] = 0;
    for( int i = 1; i <= len[0]; ++i )
        for( int j = 1; j <= len[1]; ++j )
            if( str[0][i] == str[1][j] )
                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[ len[0] ][ len[1] ]);
}

测试用例：
8 10
sadstory
adminsorry