Cod sursa(job #2171689)

Utilizator pioneer22Semeniuc Calin pioneer22 Data 15 martie 2018 13:12:23
Problema Cel mai lung subsir comun Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 1.01 kb
#include <fstream>
using namespace std;
ifstream f ("cmlsc.in");
ofstream g ("cmlsc.out");
int n,m,i,a[1030],b[1030],mat[1030][1030],j,fin[1030],nr;
int main()
{
    f>>m>>n;
    for(i=1; i<=m; ++i)
        f>>a[i];
    for(i=1; i<=n; ++i)
        f>>b[i];
    for(i=1;i<=m;++i)
    {
        for(j=1; j<=n; ++j)
        {
            if(a[i]==b[j])
            {
                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];
            }
        }
    }
    g<<mat[m][n]<<"\n";
    for(i=n, j=m; i>0 && j>0;)
    {
        if (a[i]==b[j])
        {
            fin[++nr]=a[i];
            j--;
            i--;
        }
        else
            if (mat[i-1][j]> mat[i][j-1])
                i--;
            else
                j--;
    }
    for(i=nr; i>=1; --i)
        g<<fin[i]<<" ";
    return 0;
}