Cod sursa(job #2158403)

Utilizator BourucLiviuBouruc Petru Liviu BourucLiviu Data 10 martie 2018 12:44:50
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <fstream>

#define N 1025

using namespace std;

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

int v[N], w[N], lcs[N][N], sol[N];

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

    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j)
            if(v[i] == w[j]) lcs[i][j] = lcs[i-1][j-1] + 1;
            else lcs[i][j] = max(lcs[i-1][j], lcs[i][j-1]);
    for(int i = n, j = m; i;)
    {
        if(v[i] == w[j])
        {
            sol[++sol[0]] = v[i];
            i--; j--;
        }
        else if(lcs[i-1][j] < lcs[i][j-1]) j--;
        else i--;
    }

    fout << sol[0] << '\n';
    for(int i = sol[0]; i; --i) fout << sol[i] << " ";
    fout.close();
    return 0;
}