10405 - Longest Common Subsequence

动态规划的入门题，求最长公共子序列

# include<stdio.h># include<string.h>int max(int a,int b);int d[1005][1005];char str1[1005],str2[1005];int main(){while(gets(str1)&&gets(str2)){  memset(d,0,sizeof(d));  int len1=strlen(str1);  int len2=strlen(str2);  for(int i=1;i<=len1;i++)  {  for(int j=1;j<=len2;j++)  {  if(str1[i-1]==str2[j-1])d[i][j]=d[i-1][j-1]+1;  else  {  d[i][j]=max(d[i-1][j],d[i][j-1]);  }  }  }  printf("%d\n",d[len1][len2]);}return 0;}int max(int a,int b){int ans=(a > b ? a:b);return ans;}