Common Subsequence

F - Common Subsequence
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u

Submit

Status

Practice

HDU 1159

Description

A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X =

#include<iostream>
#include<cstring>
#include<algorithm>
#include<stdio.h>
using namespace std;
const int  maxn=1000;
int dp[maxn][maxn];
char a[maxn],b[maxn];
int main()
{


    while(~scanf("%s%s",a,b))
    {
        int n=strlen(a);
        int m=strlen(b);
        memset(dp,0,sizeof(dp));
        for(int i=0;i<n;i++)
            for(int j=0;j<m;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[n][m]<<endl;
    }
    return 0;
}