POJ-1458

#include<iostream>#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;int dp[1005][1005];char a[500],b[500];int main(){    while(~scanf("%s%s",a,b))    {int i,j;        int lena=strlen(a);        int lenb=strlen(b);        for(int i=0;i<lena;i++){            for(int j=0;j<lenb;j++){                if(a[i]==b[j])                    dp[i+1][j+1]=dp[i][j]+1;                else                    dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]);            }        }        cout<<dp[lena][lenb]<<endl;for(i=0;i<=lena;i++)for(j=0;j<=lenb;j++)            dp[i][j]=0;    }    return 0;}