Hdu1159 - Common Subsequence - 动态规划

#include<stdio.h>
#include<string.h>
int dp[1005][1005];
int main()
{
char str1[1005];
char str2[1005];
while(scanf("%s %s",str1+1,str2+1)!=EOF)
{
int i,j;
int t1=strlen(str1+1);
int t2=strlen(str2+1);
memset(dp,0,sizeof(dp));
for(i=1;i<=t1;i++)
{
for(j=1;j<=t2;j++)
{
if(str1[i]==str2[j])
{
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 if(dp[i-1][j]<dp[i][j-1])
{
dp[i][j]=dp[i][j-1];
}
else
{
dp[i][j]=dp[i-1][j];
}
}
}
}
printf("%d\n",dp[t1][t2]);
}
}