zoj 1733 Common Subsequence

/*
zoj_1773    dp
最大公共子串，dp基础题
*/
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>

#define maxi(a,b) a>b?a:b
using namespace std;
int dp[1000][1000];

int main()
{
    string a,b;
    int i,j,temp;
    while( cin>>a>>b )
    {
        memset( dp,0,sizeof(dp) );
        for( i=1;i<=a.size();i++ )
        {
            for( j=1;j<=b.size();j++ )
            {
                temp=maxi( dp[i-1][j],dp[i][j-1] );
                if( a[i-1]==b[j-1] ) dp[i][j]=dp[i-1][j-1]+1;
                if( dp[i][j]<temp ) dp[i][j]=temp;
            }
        }
        cout<<dp[a.size()][b.size()]<<endl;
    }
    return 0;
}