Cod sursa(job #1154853)

Utilizator ralucik_2006Filimon Raluca Elena ralucik_2006 Data 26 martie 2014 13:59:21
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <fstream>

using namespace std;

int n,m,a[1025],b[1025],mat[1025][1025],i,j,k,sir[1025];

int main()
{
    ifstream f("cmlsc.in");
    ofstream g("cmlsc.out");
    f>>n>>m;
    for (i=1;i<=n;i++)
        f>>a[i];
    for (j=1;j<=m;j++)
        f>>b[i];
    for (i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        {
            if (a[i]==b[j]) mat[i][j]=1+mat[i-1][j-1];
            else
                mat[i][j]=max(mat[i-1][j],mat[i][j-1]);
        }
    i=n;j=m;
    k=0;
    while (i>0 && j>0)
        if (a[i]==b[j])
        {
            sir[++k]=a[i];
            i--;
            j--;
        }
        else
            if (mat[i-1][j]<mat[i][j-1]) j--;
                else i--;
    g<<k<<'\n';
    for (i=k;i>=1;i--)
    g<<sir[i]<<" ";
    return 0;
}