poj 1458 Common Subsequence

a#include <iostream>
using namespace std;
int dp[512][512];

int main()
{
char a[512],b[512];
int i,j;

while(scanf("%s%s",&a,&b)!=EOF)
{
memset(dp,0,sizeof(dp));
int la,lb;
la = strlen(a);
lb = strlen(b);
for(i = 1 ; i <= la ; i++)
for(j = 1 ; j <= lb ; j++)
{
if(a[i-1] == b[j-1])
dp[i][j] = dp[i-1][j-1]+1;
else
{
dp[i][j] = dp[i-1][j]>dp[i][j-1] ? dp[i-1][j]:dp[i][j-1];
}

}
cout<<dp[la][lb]<<endl;
}
return 0;
}