hdu 1159 Common Subsequence

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

#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxn 1000
using namespace std;

int dp[maxn][maxn];
char str1[maxn];
char str2[maxn];

int main()
{
    while(scanf("%s %s",str1,str2)!=EOF)
    {
        int k1=strlen(str1);
        int k2=strlen(str2);
        memset(dp,0,sizeof(dp));
        for(int i=1; i<=k1; i++)
        {
            for(int j=1; j<=k2; 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
",dp[k1][k2]);
    }
    return 0;
}