Subsir Comun Maximal + Reconstructie

#include <bits/stdc++.h>
#define NMax 256

using namespace std;

ifstream fin("codul.in");
ofstream fout("codul.out");

int n, m, dp[NMax][NMax];
char a[NMax], b[NMax];

void Search (int i1, int j1, int k) {
    int p1 = 0, p2 = 0;
    char mx = '0';
    if(k > 0) {
        for(int i = i1; i < n; ++i)
            for(int j = j1; j < m; ++j)
                if(dp[i][j] == k && a[i] == b[j] && a[i] > mx) {
                    mx = a[i];
                    p1 = i;
                    p2 = j;
                }
        fout << mx;
        Search(p1 + 1, p2 + 1, k - 1);
    }
}

int main() {
    fin.getline(a, 256);
    fin.getline(b, 256);
    n = strlen(a), m = strlen(b);
    for(int i = n - 1; i >= 0; i --)
        for(int j = m - 1; j >= 0; j --)
            if(a[i] == b[j])
                dp[i][j] = 1 + dp[i + 1][j + 1];
            else
                dp[i][j] = max(dp[i][j + 1], dp[i + 1][j]);
    Search(0, 0, dp[0][0]);
}