Cod sursa(job #2104698)

Utilizator 1000Sabin Ilegitim 1000 Data 12 ianuarie 2018 10:22:57
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <fstream>
using namespace std;
ifstream cin("cmlsc.in");
ofstream cout("cmlsc.out");
int n, m, a[1050], b[1050], v[1030][1030], sol[1050], k;
int main()
{
    cin >> n >> m;

    for(int i = 1; i <= n; i ++)
        cin >> a[i];
    for(int i = 1; i <= m; i ++)
        cin >> b[i];

    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= m; j ++)
            if(a[i] == b[j])
                v[i][j] = v[i - 1][j - 1] + 1;
            else
                v[i][j] = max(v[i - 1][j], v[i][j - 1]);

    for(int i = n, j = m; i; )
    {
        if(a[i] == b[j])
        {
            sol[++k] = a[i];
            i--;
            j--;
        }
        else if(v[i - 1][j] < v[i][j - 1])
            j--;
        else
            i--;
    }

    cout << k << '\n';

    for(int i = k; i >= 1; i --)
        cout << sol[i] << " ";

    return 0;
}