Cod sursa(job #1731581)

Utilizator ewaldBerla Ewald ewald Data 19 iulie 2016 12:18:36
Problema Cel mai lung subsir comun Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <fstream>

using namespace std;
ifstream f ("cmlsc.in");
ofstream g ("cmlsc.out");

int n,m,i,j,x[1025],y[1025],a[1025][1025],sir[1025],k;
int main()
{

    f>>n>>m;
    for(i=1;i<=n;i++)
        f>>x[i];
    for(i=1;i<=m;i++)
        f>>y[i];
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        if(x[i]==y[j])
        a[i][j]=a[i-1][j-1]+1;
    else a[i][j]=max(a[i][j-1],a[i-1][j]);
    g<<a[n][m]<<endl;
    i=n;j=m;
    while(i && j)
    {
        if(x[i]==y[j])sir[++k]=x[i],i--,j--;
        else
        {
            if(a[i][j-1]>a[i-1][j])j--;
            else i--;
        }
    }
    for(i=k;i>=1;i--)
    g<<sir[i]<<" ";
    return 0;
}