Cod sursa(job #2642555)

Utilizator MiclosMiclos Eduard Miclos Data 15 august 2020 23:22:15
Problema Cel mai lung subsir comun Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.2 kb
#include <iostream>
#include <fstream>
#include <vector>

#define MAX(a,b) ( (a > b) ? a : b )

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

int M, N, i, j, k;
int V1[1050], V2[1050];
int Matrix[1050][1050];
std::vector <int> Result;

int main() {
    fin >> M >> N;

    for (i = 1; i <= M; i++)
        fin >> V1[i];

    for (i = 1; i <= N; i++)
        fin >> V2[i];

    for (i = 1; i <= M; i++) {
        for (j = 1; j <= N; j++) {
            if (V1[i] == V2[j])
                Matrix[i][j] = Matrix[i - 1][j - 1] + 1;
            else
                Matrix[i][j] = MAX(Matrix[i - 1][j], Matrix[i][j - 1]);
        }
    }

    fout << Matrix[M][N] << "\n";
    
    i = M;
    j = N;
    k = Matrix[i][j];

    while (k) {
        if (V1[i] == V2[j] && Matrix[i][j] == Matrix[i-1][j-1] + 1) {
            Result.push_back(V1[i]);
            i--;
            j--;
            k--;
        }
        else if (Matrix[i - 1][j] == Matrix[i][j])
            i--;
        else
            j--;
    }


    for (int i = Result.size() - 1; i >= 0; i--)
        fout << Result[i] << " ";

    fin.close();
    fout.close();
        
    return 0;
}