Cod sursa(job #1368893)

Utilizator bianncaPoenar Bianca biannca Data 2 martie 2015 20:31:27
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
//#include <iostream>
#include<fstream>
#define mx 1050
using namespace std;
fstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int n,m,i,j,a[1100],b[1100],c[1100],d[1100][1100],nr;
int main()
{
    int i,j;
    fin>>n>>m;
    for(i=1;i<=n;++i)
        fin>>a[i];
    for(i=1;i<=m;++i)
        fin>>b[i];
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
            if(a[i]==b[j])
            d[i][j]=1+d[i-1][j-1];
        else
            d[i][j]=max(d[i-1][j], d[i][j-1]);
    fout<<d[n][m]<<'\n';
    i=n; j=m;
    while(i!=0 && j!=0)
    {
        if(a[i]==b[j])
        {
            ++nr;
            c[nr]=a[i];
            --i; --j;
        }
        else if (d[i-1][j]>d[i][j-1]) --i;
        else --j;
    }
        for(i=nr;i>=1;i--)
            fout<<c[i]<<" ";
        fin.close();
        fout.close();
    return 0;
}