hdu--1159 common sequense(最长公共子序列)

#include "stdio.h"#include "math.h"#include "string.h"int s[1000][1000];int main(){ char str1[1000],str2[1000],str3[1000]; int len1,len2,i,j;while(scanf("%s %s",str1,str2)!=EOF){len1=strlen(str1);len2=strlen(str2); s[len1][len2]=0; i=len1;j=len2;while(i>=0) { s[i][len2]=0; i--; }while(j>=0) { s[len1][j]=0; j--; }for(i=len1-1; i>=0; i--){for(j=len2-1; j>=0; j--)if(str1[i]==str2[j]) s[i][j]=s[i+1][j+1]+1;else if (s[i+1][j] > s[i][j+1]){s[i][j]=s[i+1][j];}else s[i][j]=s[i][j+1];}printf("%d/n",s[0][0]);}return 0;}