lcs.cpp

#include <bits/stdc++.h>
using namespace std;

int lcs(string s1, string s2, int m, int n)
{
    int arr[m + 1][n + 1];
    for (int i = 0; i <= m; i++)
    {
        for (int j = 0; j <= n; j++)
        {
            if (i == 0 || j == 0)
            {
                arr[i][j] = 0;
            }
            else if (s1[i - 1] == s2[j - 1])
            {
                arr[i][j] = arr[i - 1][j - 1] + 1;
            }
            else
            {
                arr[i][j] = max(arr[i][j - 1], arr[i - 1][j]);
            }
            cout << arr[i][j] << " ";
        }
        cout << endl;
    }
    cout << endl;
    return arr[m][n];
}
int main()
{
    string s1, s2;
    getline(cin, s1);
    getline(cin, s2);
    int m = s1.size();
    int n = s2.size();
    cout << "lcs Lenth is : " << lcs(s1, s2, m, n) << endl;
    return 0;
}