lcs.cpp

LCS 是一個能從輸入兩串字串當中找出最長的由左而右的順序的字元

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

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