Cod sursa(job #1918353)

Utilizator TeoShefuTauCalin Teodor Georgian TeoShefuTau Data 9 martie 2017 15:05:35
Problema Cel mai lung subsir comun Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.94 kb
#include <iostream>
#include <fstream>
#include <cstring>

using namespace std;

int m, n, i, j, contor;
int a[260], b[260], sir[260];
int d[1025][1025];


int main()
{
    ifstream fin("cmlsc.in");
    ofstream gout("cmlsc.out");
    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]=d[i-1][j-1]+1;
                    else d[i][j]=max(d[i][j-1], d[i-1][j]);
            }

    gout<<d[n][m]<<"\n";


    i=n; j=m;
    while(i>=1 && j>=1)
        {
            if(a[i]==b[j])
                {
                    sir[++contor]=a[i];
                    i--; j--;
                }
                else if(d[i-1][j]<d[i][j-1]) j--;
                    else i--;
        }


    for(i=contor; i>=1; i--)
        gout<<sir[i]<<" ";





    return 0;
}