Cod sursa(job #2795918)

Utilizator P1zd0SuntBetoAlbert Beto P1zd0SuntBeto Data 7 noiembrie 2021 11:10:38
Problema Cel mai lung subsir comun Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.89 kb
#include <iostream>
#include <fstream>
using namespace std;

int A[1024], B[1024];
short N, M;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");


int main()
{
    cin >> M >> N;
    int matrix[256][256],subsir[256],count = 0;
    for (int i = 1; i <= M; i++)
        cin >> A[i];
    for (int i = 1; i <= N; i++)
        cin >> B[i];

    for(int i=0;i<=M;i++)
        for (int j = 0; j <= N; j++)
        {
            if (A[i] == B[j]) {
                matrix[i][j] = matrix[i - 1][j - 1] + 1;
                subsir[count] = A[i];
                count++;
            }
            if (A[i] != B[j])
                matrix[i][j] = max(matrix[i - 1][j], matrix[i][j - 1]);
            if (!i or !j)
                matrix[i][j] = 0;
        }

    cout << matrix[M][N] << endl;
    
    for (int i = 1; i < count; i++)
        cout << subsir[i] << " ";

    return 0;
}