Cod sursa(job #2595634)
| Utilizator | Data | 8 aprilie 2020 01:11:05 | |
|---|---|---|---|
| Problema | Cel mai lung subsir comun | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("cmlsc.in");
ofstream fout("cmlsc.out");
int m, n, a[1025], b[1025], i, j, mx = 0, c[1025];
fin >> m >> n;
for(i=1; i<=m; i++)
fin >> a[i];
for(j=1; j<=n; j++)
fin >> b[j];
for(i=1; i<=n; i++)
for(j=i; j<=m-n+i; j++)
if(b[i]==a[j])
{
mx++;
i++;
c[mx]=a[j];
}
fout << mx << "\n";
for(i=1; i<=mx; i++)
fout << c[i] << ' ';
return 0;
}
