Cod sursa(job #2257487)

Utilizator mihaicosmin2011Mihai Cosmin mihaicosmin2011 Data 10 octombrie 2018 09:34:11
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <bits/stdc++.h>
#define Nmax 1025
using namespace std;
int a[Nmax], b[Nmax], dp[Nmax][Nmax], lcs[Nmax], i, j, n, m, k;
int main ()
{
    ifstream f("cmlsc.in");
    ofstream g("cmlsc.out");
    f >> n >> m;
    for(i = 1; i <= n; i ++)
        f >> a[i];
    for(i = 1; i <= m; i ++)
        f >> b[i];
    for(i = 1; i <= n; i ++)
        for(j = 1; j <= m; j ++)
            if(a[i] == b[j]) dp[i][j] = dp[i - 1][j - 1] + 1;
                        else dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
    for(i = n, j = m; i; )
        if(a[i] == b[j]) lcs[++ k] = a[i], --i, --j;
            else if (dp[i - 1][j] < dp[i][j - 1]) j --;
                 else i --;
    g << k << "\n";
    for(i = k; i >= 1; i --)
        g << lcs[i] << " ";
    return 0;
}