Poj 1458 Common Subsequence（LCS)

 1 #include<stdio.h>
 2 #include<string.h>
 3 #include<algorithm>
 4 #include<iostream>
 5 using namespace std;
 6 char s1[1000000],s2[1000000];
 7 int vis[500][500];
 8 int main()
 9 {
10     int i,j,n,m,n1,n2;
11     while(scanf("%s",s1)!=EOF)
12     {
13         n1=0,n2=0;
14         memset(vis,0,sizeof(vis));
15         scanf("%s",s2);
16         n1=strlen(s1);
17         n2=strlen(s2);
18         for(i=0; i<n1; i++)
19         {
20             for(j=0; j<n2; j++)
21             {
22                 if(s1[i]==s2[j])
23                 {
24                     vis[i][j]=vis[i-1][j-1]+1;
25                 }
26                 else
27                     vis[i][j]=max(vis[i-1][j],vis[i][j-1]);
28             }
29         }
30         printf("%d\n",vis[n1-1][n2-1]);
31     }
32 }