Cod sursa(job #1644163)

Utilizator larecursividadLa Recursividad larecursividad Data 9 martie 2016 21:47:47
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.06 kb
#include <fstream>
#define InFile  "cmlsc.in"
#define OutFile "cmlsc.out"
#define VAL 1025

using namespace std;

ifstream fin  (InFile);
ofstream fout (OutFile);

unsigned short int M, N;
unsigned short int A[VAL], B[VAL];

unsigned short int matrix[VAL][VAL];
unsigned short int i, j;

unsigned short int MAX;
unsigned short int C[VAL];

int main ()
{
    fin >> M >> N;
    for (i=1; i<=M; i++)
        fin >> A[i];
    for (j=1; j<=N; j++)
        fin >> B[j];
    for (i=1; i<=M; i++)
        for (j=1; j<=N; j++)
            if (A[i] == B[j])
                matrix[i][j] = matrix[i-1][j-1] + 1;
            else
                matrix[i][j] = max(matrix[i-1][j],matrix[i][j-1]);
    i = M;
    j = N;
    while (matrix[i][j])
    {
        while (matrix[i][j] == matrix[i-1][j])
            i--;
        while (matrix[i][j] == matrix[i][j-1])
            j--;
        MAX++;
        C[MAX] = A[i];
        i--;
        j--;
    }
    fout << MAX << '\n';
    for (i=MAX; i>=1; i--)
        fout << C[i] << ' ';
    return 0;
}