UVA - 10405 Longest Common Subsequence

LCS

注意必须用gets

#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAX 1100
using namespace std;

char s[MAX],t[MAX];
int dp[MAX][MAX];

int main()
{
    int i,j,tt,len1,len2,maxx;
    while(gets(s)!=NULL)
    {
        gets(t);
        len1=strlen(s),len2=strlen(t);
        memset(dp,0,MAX*MAX*4);
        maxx=0;
        for(i=1;i<=len1;i++)
        {
            for(j=1;j<=len2;j++)
            {
                if(t[j-1]==s[i-1])
                {
                    dp[i][j]=dp[i-1][j-1]+1;
                }
                else
                {
                    dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }
        printf("%d\n",dp[len1][len2]);
    }
    return 0;
}