poj1458(Common Subsequence)

            题目连接：http://poj.org/problem?id=1458

         题目大意：求两字符串的最长公共子串

Code：

#include<stdio.h>#include<string.h>char s1[500],s2[500];int com[500][500];int len1,len2;int max(int a,int b){return a>b ? a : b;}int main(){int i,j;while(scanf("%s %s",s1+1,s2+1)!=EOF){memset(com,0,sizeof(com));len1=strlen(s1+1);len2=strlen(s2+1);for(i=1;i<=len1;i++)for(j=1;j<=len2;j++){if(s1[i] == s2[j])com[i][j]=com[i-1][j-1]+1;else com[i][j]=max(com[i-1][j],com[i][j-1]);}printf("%d\n",com[len1][len2]);}return 0;}