Cod sursa(job #1254352)

Utilizator cristinelulCristian Virga cristinelul Data 2 noiembrie 2014 16:13:56
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <fstream>

using namespace std;

ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");

int n,m,i,j,b,a[1025][1025],v1[1025],v2[1025];
char x[1000001];
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>v1[i];
    for(i=1;i<=m;i++)
        fin>>v2[i];
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        {
            if(v1[i]==v2[j])
            {
                a[i][j]=1+a[i-1][j-1];
                x[++b]=v1[i];
            }
            else
                a[i][j]=max(a[i-1][j],a[i][j-1]);
        }
    fout<<a[n][m]<<'\n';
    for(i=1;i<=a[n][m];i++)
        fout<<x[i]<<' ';
    fout.close();
    return 0;
}