Cod sursa(job #2444998)

Utilizator Mihai145Oprea Mihai Adrian Mihai145 Data 2 august 2019 10:34:14
Problema Cel mai lung subsir comun Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.91 kb
#include <fstream>

using namespace std;

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

const int NMAX = 1024;

int N, M;
int v[NMAX + 5], w[NMAX + 5];
int dp[NMAX + 5][NMAX + 5];
int k, sol[NMAX + 5];

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

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

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

    for(int i = 1; i <= N; i++)
        for(int j = 1; j <= M; j++)
            if(v[i] == w[j])
                dp[i][j] = 1 + dp[i - 1][j - 1];
            else
                dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);

    fout << dp[N][M] << '\n';

    int x = N, y = M;
    while(dp[x][y]) {

        if(dp[x][y] != dp[x - 1][y] && dp[x][y] != dp[x][y - 1])
            sol[++k] = v[x], x--, y--;
        else if(dp[x][y] == dp[x - 1][y])
            x--;
        else
            y--;

    }

    for(int i = k; i >= 1; i--)
        fout << sol[i] << ' ';

    return 0;
}