Cod sursa(job #2163878)

Utilizator DanielznaceniDaniel Danielznaceni Data 12 martie 2018 20:18:57
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cmlsc.in");
ofstream out("cmlsc.out");
int n, m, i, a[1030], b[1030], mat[1030][1030], j, fin[1030], cate;
int main()
{
    in>>m>>n;
    for(i=1; i<=m; ++i)
        in>>a[i];
    for(i=1; i<=n; ++i)
        in>>b[i];
    for(i=1; i<=m; ++i)
    {
        for(j=1; j<=n; ++j)
        {
            if(a[i]==b[j])
            {
                ++cate;
                fin[cate]=a[i];
                mat[i][j]=mat[i-1][j-1]+1;
            }
            else
            {
                if(mat[i][j-1]>mat[i-1][j])
                    mat[i][j]=mat[i][j-1];
                else
                    mat[i][j]=mat[i-1][j];
            }
        }
    }
    out<<cate<<"\n";
    for(i=1; i<=cate; ++i)
        out<<fin[i]<<" ";
    return 0;
}