Cod sursa(job #2607724)

Utilizator NicuCNicu Capatina NicuC Data 30 aprilie 2020 08:54:36
Problema Cel mai lung subsir comun Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.89 kb
#include <bits/stdc++.h>

#define MAXSIZE 1025

using namespace std;

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

int n, m, v[MAXSIZE], w[MAXSIZE], i, j;
int dp[MAXSIZE][MAXSIZE];

int main() {
    fin >> m >> n;
    vector<int> sol;
    for (i = 1; i <= m; i++)
        fin >> v[i];
    for (i = 1; i <= n; i++)
        fin >> w[i];


    for (i = 1; i <= m; i++) {
        for (j = 1; j <= n; j++) {
            dp[i][j] = max(dp[i][j - 1], max(dp[i - 1][j], dp[i - 1][j - 1] + (v[i] == w[j])));
        }
    }
    fout << dp[m][n] << '\n';
    i = m;
    j = n;
    while (i != 0 && j != 0) {
       if(v[i] == w[j])
       {
           sol.push_back(v[i]);
           i--;
           j--;
       }
       else if (dp[i-1][j] > dp[i][j-1])
           i--;
       else
           j--;
    }
    for (i = sol.size() - 1; i >= 0; i--)
        fout << sol[i] << ' ';
    fout << '\n';
    return 0;
}