Cod sursa(job #2340362)

Utilizator bluestorm57Vasile T bluestorm57 Data 10 februarie 2019 12:50:18
Problema Cel mai lung subsir comun Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.67 kb
#include <fstream>

using namespace std;

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

int a[1025],b[1025],n,m,mat[1025][1025],c[1025],o;

int main(){
    int i,j;
    f>>n>>m;
    for(i=1; i<=n; i++)
        f>>a[i];
    for(j=1; j<=m; j++)
        f>>b[j];

    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;
    while(i)
    if(a[i]==b[j])
        c[++o]=a[i--],j--;
    else
        if(mat[i-1][j]<mat[i][j-1])
        j--;
    else
        i--;

    g<<o<<"\n";
    for(i=o;i;i--)
    g<<c[i]<<" ";
    return 0;
}