056_最长公共子序列

//
//  056_longest subsequence.cpp
//  changlle
//
//  Created by user on 12/27/15.
//  Copyright (c) 2015 user. All rights reserved.
//

#include <iostream>
#include <algorithm>
using namespace std;

int m=4;
int n=4;

char s[]="abcd";
char t[]="becd";

int main() {

int dp[5][5];
memset(dp,0,sizeof(dp));

for (int i=0;i<m;i++)
for (int j=0;j<n;j++)
{
if (s[i]==t[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]);

}

for (int i=0;i<=m;i++)
{
for (int j=0;j<=n;j++)
cout<<dp[i][j]<<"  ";
cout<<endl;
}

cout<<dp[m]
<<endl;

return 0;
}