Cod sursa(job #3144617)

Utilizator stanciu_anaStanciu Ana-Maria stanciu_ana Data 9 august 2023 13:17:40
Problema Cel mai lung subsir comun Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.72 kb
#include <fstream>

using namespace std;

ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");

int n, m, M[1025][1025];
int v1[1025], v2[1025], sir[1025], cnt;

int main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        cin >> v1[i];
    for(int j = 1; j <= m; j++)
        cin >> v2[j];
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
    {
        if(v1[i] == v2[j])
           {
               cnt++;
               sir[cnt] = v1[i];
               M[i][j] = M[i-1][j-1] + 1;
           }
        else
            M[i][j] = max(M[i-1][j], M[i][j-1]);
    }
    cout << M[n][m]<<'\n';
    for(int i = 1; i <= cnt; i++)
        cout << sir[i]<<' ';

    return 0;
}