lcs.cpp

Instead of finding the longest common subsequence, let us try to determine the length of the LCS.

/************ hw5_LCS_s95610047 ************/

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

int main(void)
{
    int i, j;
    int m, n;
    cout << " Longest Common Subsequence(LCS) \n\n"; 
    cout << "  叫块