Cod sursa(job #2194330)

Utilizator RaresLiscanLiscan Rares RaresLiscan Data 12 aprilie 2018 21:41:59
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include <bits/stdc++.h>

using namespace std;
ifstream fin ("cmlsc.in");
ofstream fout ("cmlsc.out");
int a[1030],b[1030];
bool x[1030];
int main()
{
    int n,m;
    fin>>n>>m;
    for (int i=1;i<=n;i++) fin>>a[i];
    for (int i=1;i<=m;i++) fin>>b[i];
    int maxim=0,inceput=m;
    for (int i=1;i<=n;i++) {
        for (int j=1;j<=m;j++) {
            if (a[i]==b[j]&&inceput>j) x[inceput]=0,inceput=j,x[inceput]=1,maxim=1;
            else if (a[i]==b[j]) x[j]=1,maxim++;
        }
    }
    fout<<maxim<<"\n";
    for (int i=1;i<=n;i++) {
        if (x[i]) fout<<b[i]<<" ";
    }
    return 0;
}